Dear customers, due to a public holiday, customer support is not available today. We will attend to your requests the next business day. Thank you for your understanding.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Austrian Post 5.49 € DPD courier 3.99 € DPD point 2.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Dear customers, due to a public holiday, customer support is not available today. We will attend to your requests the next business day. Thank you for your understanding.

Iterative Methods in Combinatorial Optimization

Name: Iterative Methods in Combinatorial Optimization
Brand: Cambridge University Press
SKU: 04390579
Price: 69.29 EUR
Availability: InStock
Author: Lap-Chi Lau
ISBN: 9780521189439

Lap-Chi Lau

Language

English

Book Paperback

Libristo code: 04390579

Publishers Cambridge University Press, April 2011

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several... Full description

Libristo code: 04390579

170 b

69.29 € VAT included

In stock at our supplier Shipping in 9-15 days

Delivery to Austria

30-day return policy

Customers also purchased

Alfonsina: Un Viaje Poético Y Teatral Por La Vida Y Obra de Alfonsina Storni Dario Cortes

Paperback

9.59 €

Remplace par mon chef: Promotion pour une éviction Fred Haras

Paperback

10.69 €

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.