Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

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

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Iterative Methods in Combinatorial Optimization

Name: Iterative Methods in Combinatorial Optimization
Brand: Cambridge University Press
SKU: 04390579
Price: 25533 HUF
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

174 b

25 533 Ft

In stock at our supplier Shipping in 9-15 days

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

3 582 Ft

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

Paperback

3 961 Ft

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.