Items related to Computational Combinatorial Optimization: Optimal or...
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions: 2241 (Lecture Notes in Computer Science, 2241) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Synopsis
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.
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2001
- ISBN 10 3540428771
- ISBN 13 9783540428770
- BindingPaperback
- LanguageEnglish
- Number of pages320
- EditorJünger Michael, Naddef Denis
Search results for Computational Combinatorial Optimization: Optimal or...
Stock Image
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science)
Seller: Books From California, Simi Valley, CA, U.S.A.
Seller rating 4 out of 5 stars
Paperback. Condition: Good. Ex- library book with stamps/ stickers. Seller Inventory # mon0003288752
Quantity: 1 available
Seller Image
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 916264-n
Quantity: Over 20 available
Stock Image
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science, 2241)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540428770_new
Quantity: Over 20 available
Seller Image
Computational Combinatorial Optimization
Published by
Springer Berlin Heidelberg Nov 2001, 2001
ISBN 10: 3540428771
ISBN 13: 9783540428770
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540428770
Quantity: 2 available
Seller Image
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 916264
Quantity: Over 20 available
Seller Image
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Published by
Springer Berlin Heidelberg, 2001
ISBN 10: 3540428771
ISBN 13: 9783540428770
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540428770
Quantity: 1 available
Stock Image
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540428770
Quantity: 10 available
Seller Image
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 916264-n
Quantity: Over 20 available
Seller Image
Computational Combinatorial Optimization
Published by
Springer Berlin Heidelberg, 2001
ISBN 10: 3540428771
ISBN 13: 9783540428770
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 4890120
Quantity: Over 20 available
Seller Image
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 916264
Quantity: Over 20 available