Iterative methods in combinatorial optimization
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
- 9780521189439
- 518.26 22 LAU-I
- QA297.8 .L38 2011
- COM000000
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
![]() |
IIITD Reference | Mathematics | REF 518.26 LAU-I (Browse shelf(Opens below)) | Available | 004399 |
Browsing IIITD shelves, Shelving location: Reference, Collection: Mathematics Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
REF 518.2 GRE-N Numerical methods : | REF 518.2 LIN-N Numerical methods : | REF 518.2 MAT-N Numerical methods using MATLAB | REF 518.26 LAU-I Iterative methods in combinatorial optimization | REF 518.5 WIL-D The design of approximation algorithms | REF 518.64 ODE-I An introduction to the mathematical theory of finite elements | REF 519 FEL-I Introduction to probability : |
Includes bibliographical references and index.
"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"--
"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"--
There are no comments on this title.