Order Total (1 Item Items):
Shipping Destination:
Computational Combinatorial Optimization Optimal (9 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (9)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (6)
- As New, Fine or Near Fine (2)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (9)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (5)
- Not Print on Demand (9)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50
- Over US$ 50
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
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 5 out of 5 stars
Paperback. Condition: Good. Ex- library book with stamps/ stickers.
-
US$ 60.88
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 59.54
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 69.31
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
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
US$ 70.94
Convert currencyUS$ 16.24 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
US$ 66.74
Convert currencyUS$ 21.00 shipping from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPF. Condition: New.
-
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 70.21
Convert currencyUS$ 20.33 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 77.76
Convert currencyUS$ 20.33 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Published by Springer Berlin Heidelberg, 2001
ISBN 10: 3540428771 ISBN 13: 9783540428770
Language: English
US$ 64.48
Convert currencyUS$ 35.62 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketTaschenbuch. 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.
