Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Iterative Methods in Combinatorial Optimization

Iterative Methods in Combinatorial Optimization

Ravi, R.
Singh, Mohit
Lau, Lap-Chi

Paperback

Series: Cambridge Texts in Applied Mathematics, Book 46

Programming

ISBN10: 0521189438
ISBN13: 9780521189439
Publisher: Cambridge University Press
Published: Apr 18 2011
Pages: 256
Weight: 0.80
Height: 0.70 Width: 6.00 Depth: 8.90
Language: English
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.

1 different editions

Also available

Also from

Lau, Lap-Chi

View All

Also in

Programming

View All