Items related to Computational Combinatorial Optimization: Optimal or...
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science, 2241) - Softcover
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.
- PublisherSpringer
- Publication date2001
- ISBN 10 3540428771
- ISBN 13 9783540428770
- BindingPaperback
- Number of pages320
- EditorJünger Michael, Naddef Denis
Buy New
Learn more about this copy
US$ 55.79
Shipping:
FREE
Within U.S.A.
Top Search Results from the AbeBooks Marketplace
Seller Image
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science (2241)) by J??nger, Michael, Naddef, Denis [Paperback ]
Seller:
Rating
Book Description Soft Cover. Condition: new. Seller Inventory # 9783540428770
Buy New
US$ 55.79
Convert currency
Seller Image
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Seller:
Rating
Book Description Condition: New. Seller Inventory # 916264-n
Buy New
US$ 60.63
Convert currency
Stock Image
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science, 2241)
Published by
Springer
(2001)
ISBN 10: 3540428771
ISBN 13: 9783540428770
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Seller Inventory # ABLIING23Mar3113020167310
Buy New
US$ 59.29
Convert currency
Stock Image
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Published by
Springer
(2001)
ISBN 10: 3540428771
ISBN 13: 9783540428770
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783540428770_lsuk
Buy New
US$ 64.10
Convert currency
Seller Image
Computational Combinatorial Optimization
Published by
Springer Berlin Heidelberg Nov 2001
(2001)
ISBN 10: 3540428771
ISBN 13: 9783540428770
New
Taschenbuch
Quantity: 2
Seller:
Rating
Book Description 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
Buy New
US$ 59.83
Convert currency
Stock Image
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Seller:
Rating
Book Description PF. Condition: New. Seller Inventory # 6666-IUK-9783540428770
Buy New
US$ 73.70
Convert currency
Stock Image
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions
Published by
Springer
(2001)
ISBN 10: 3540428771
ISBN 13: 9783540428770
New
Softcover
First Edition
Quantity: 15
Seller:
Rating
Book Description Condition: 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. . . . . Seller Inventory # V9783540428770
Buy New
US$ 86.43
Convert currency
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
Quantity: 1
Seller:
Rating
Book Description 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
Buy New
US$ 64.99
Convert currency
Seller Image
Computational Combinatorial Optimization
Published by
Springer Berlin Heidelberg
(2001)
ISBN 10: 3540428771
ISBN 13: 9783540428770
New
Kartoniert / Broschiert
Quantity: > 20
Seller:
Rating
Book Description Kartoniert / Broschiert. 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
Buy New
US$ 54.11
Convert currency
Stock Image
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions
Seller:
Rating
Book Description Condition: 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. . . . . Books ship from the US and Ireland. Seller Inventory # V9783540428770
Buy New
US$ 100.81
Convert currency