| 000 | 02761 a2200301 4500 | ||
|---|---|---|---|
| 010 | _a 2011003653 | ||
| 020 | _a9780521189439 | ||
| 035 | _a(OCoLC)ocn694393831 | ||
| 050 | 0 | 0 | _aQA297.8 |
| 082 | 0 | 0 | _a518.26 |
| 084 | _2bisacsh | ||
| 090 |
_c31953 _d31953 |
||
| 100 | 1 | _aLau, Lap Chi | |
| 546 | _aeng | ||
| 245 | 1 | 0 |
_aIterative methods in combinatorial optimization _cLap Chi Lau, R. Ravi, Mohit Singh |
| 260 |
_aCambridge ; _aNew York : _bCambridge University Press, _c2011 |
||
| 300 |
_axi, 242 p. _bill. _c24 cm |
||
| 490 | 1 | _aCambridge texts in applied mathematics | |
| 500 | _aBibliografie p. 233 Index p. 241 | ||
| 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"-- | ||
| 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"-- | ||
| 650 | 0 | _aIterative methods (Mathematics) | |
| 650 | 0 | _aCombinatorial optimization | |
| 700 | 1 |
_aRavi, R. _d1969- |
|
| 700 | 1 | _aSingh, Mohit | |
| 830 | 0 | _aCambridge texts in applied mathematics | |
| 942 |
_aIMAR _cCART _k518.26 _sEP |
||
| 999 |
_c31512 _d31512 |
||