Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Spese di spedizione:
GRATIS
In U.S.A.
Descrizione libro Soft Cover. Condizione: new. Codice articolo 9783540428770
Descrizione libro Condizione: New. Codice articolo ABLIING23Mar3113020167310
Descrizione libro Condizione: New. Codice articolo 916264-n
Descrizione libro Condizione: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Codice articolo ria9783540428770_lsuk
Descrizione libro Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality. 320 pp. Englisch. Codice articolo 9783540428770
Descrizione libro Condizione: New. Codice articolo 916264-n
Descrizione libro PF. Condizione: New. Codice articolo 6666-IUK-9783540428770
Descrizione libro Condizione: New. This tutorial contains seven lectures on computational combinatorial optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Editor(s): Junger, Michael (Universitat zu Koln, Germany); Naddef, Dennis. Series: Lecture Notes in Computer Science. Num Pages: 320 pages, biography. BIC Classification: PBU. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 17. Weight in Grams: 451. . 2001. 2001st Edition. paperback. . . . . Codice articolo V9783540428770
Descrizione libro Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality. Codice articolo 9783540428770
Descrizione libro Kartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and. Codice articolo 4890120