Iterative methods in combinatorial optimization / Lap Chi Lau, R. Ravi, Mohit Singh.
"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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Language: | English |
| Published: |
Cambridge ; New York :
Cambridge University Press,
2011.
|
| Series: | Cambridge texts in applied mathematics.
|
| Subjects: | |
| Physical Description: | xi, 242 pages : illustrations ; 24 cm. |
| Format: | Book |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | in00004979907 | ||
| 003 | OCoLC | ||
| 005 | 20220616032634.0 | ||
| 008 | 110202s2011 enka b 001 0 eng | ||
| 020 | |a 9781107007512 (hardback) | ||
| 020 | |a 1107007518 (hardback) | ||
| 020 | |a 9780521189439 (pbk.) | ||
| 020 | |a 0521189438 (pbk.) | ||
| 035 | |a (CaEvSKY)sky235094939 | ||
| 035 | |a (OCoLC)694393831 | ||
| 040 | |a DLC |c DLC |d YDX |d BTCTA |d YDXCP |d BWX |d UtOrBLW | ||
| 042 | |a pcc | ||
| 049 | |a EEMO | ||
| 050 | 0 | 0 | |a QA297.8 |b .L38 2011 |
| 082 | 0 | 0 | |a 518/.26 |2 22 |
| 100 | 1 | |a Lau, Lap Chi. |0 http://id.loc.gov/authorities/names/n2011006981 | |
| 245 | 1 | 0 | |a Iterative methods in combinatorial optimization / |c Lap Chi Lau, R. Ravi, Mohit Singh. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 2011. | ||
| 300 | |a xi, 242 pages : |b illustrations ; |c 24 cm. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a unmediated |b n |2 rdamedia | ||
| 338 | |a volume |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cambridge texts in applied mathematics | |
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 8 | |a 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. | |
| 520 | |a "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"-- |c Provided by publisher. | ||
| 520 | |a "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"-- |c Provided by publisher. | ||
| 650 | 0 | |a Iterative methods (Mathematics) |0 http://id.loc.gov/authorities/subjects/sh85069058 | |
| 650 | 0 | |a Combinatorial optimization. |0 http://id.loc.gov/authorities/subjects/sh85028809 | |
| 700 | 1 | |a Ravi, R. |q (Ramamoorthi), |d 1969- |0 http://id.loc.gov/authorities/names/n00003544 | |
| 700 | 1 | |a Singh, Mohit. |0 http://id.loc.gov/authorities/names/n2011006983 | |
| 830 | 0 | |a Cambridge texts in applied mathematics. |0 http://id.loc.gov/authorities/names/n86719346 | |
| 907 | |y .b90480405 |b 210805 |c 111018 | ||
| 998 | |a rs |b 120116 |c m |d a |e - |f eng |g enk |h 0 |i 2 | ||
| 999 | f | f | |i 4bcabb10-0858-5dca-bd35-187167cbff72 |s 132eb9f4-4d56-5dde-b80f-b85b5469c12b |t 0 |
| 952 | f | f | |p Can Circulate |a Michigan State University-Library of Michigan |b Michigan State University |c MSU Remote Storage |d MSU Remote Storage |t 0 |e QA297.8 .L38 2011 |h Library of Congress classification |i Printed Material |m 31293007215902 |n 1 |