L'édition de cet ISBN n'est malheureusement plus disponible.
Afficher les exemplaires de cette édition ISBNLes informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Frais de port :
Gratuit
Vers Etats-Unis
Description du livre Soft Cover. Etat : new. N° de réf. du vendeur 9783540428770
Description du livre Etat : New. N° de réf. du vendeur ABLIING23Mar3113020167310
Description du livre Etat : New. N° de réf. du vendeur 916264-n
Description du livre Etat : New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. N° de réf. du vendeur ria9783540428770_lsuk
Description du livre Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540428770
Description du livre Etat : New. N° de réf. du vendeur 916264-n
Description du livre PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783540428770
Description du livre Etat : 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. . . . . N° de réf. du vendeur V9783540428770
Description du livre Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540428770
Description du livre Kartoniert / Broschiert. Etat : 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. N° de réf. du vendeur 4890120