Iterative methods in combinatorial optimization /
Saved in:
| Author / Creator: | Lau, Lap Chi. |
|---|---|
| Imprint: | Cambridge ; New York : Cambridge University Press, ©2011. |
| Description: | 1 online resource (xi, 242 pages) : illustrations |
| Language: | English |
| Series: | Cambridge texts in applied mathematics Cambridge texts in applied mathematics. |
| Subject: | |
| Format: | E-Resource Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/11827310 |
| 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. |
|---|---|
| Physical Description: | 1 online resource (xi, 242 pages) : illustrations |
| Bibliography: | Includes bibliographical references (pages 233-240) and index. |
| ISBN: | 9781139081078 1139081071 9781139078801 1139078801 9780511977152 0511977158 9781283111164 1283111160 9781107007512 1107007518 9780521189439 0521189438 |