Iterative methods in combinatorial optimization
by Lau, Lap Chi
"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 ma…
Read More ↓Title Statements
- Full title :Iterative methods in combinatorial optimization / Lap Chi Lau, R. Ravi, Mohit Singh
Summary
"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"-
Read More ↓Edition Statements
- Publication Date:2011
Publication Statements
- Publisher(s):Cambridge University Press
- Place of Publication:Cambridge
- Language:eng
- Publication Date:2011
The Physical Object
- Description:Online-Ressource (xi, 242 Seiten) : Illustrationen
Edition Identifiers
- ISBN:9780521189439, 0521189438, 9781107007512, 1107007518, 9780511977152, 0511977158
- DOI:10.1017/CBO9780511977152
- oclc:ocn839012569
- LC Classification:QA297.8
- Dewey Decimal:518/.26
Table of Contents
Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary.
Read More ↓Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Related Works
more →
Integer programming and combinatorial optimization
Conference on Integer Programming and Combinatorial Optimization, Houston, Tex.))
Optimization algorithms in physics
Files & Downloads
-
Iterative methods in combinatorial optimization -…
PDF · 1.2 MB · updated -
Iterative Methods in Combinatorial Optimization -…
PDF · 1.4 MB · updated -
Iterative Methods in Combinatorial Optimization -…
PDF · 3.1 MB · updated
Rate & Review