| 000 | 01377nam a22002297a 4500 | ||
|---|---|---|---|
| 999 |
_c1334 _d1334 |
||
| 005 | 20210927122302.0 | ||
| 008 | 210927b ||||| |||| 00| 0 eng d | ||
| 020 | _a9780486402581 | ||
| 082 |
_a511.6 _bPAP |
||
| 100 |
_aPapadimitriou, Christos H. _93744 |
||
| 245 | _aCombinatorial optimization: algorithms and complexity | ||
| 260 |
_bDover Publication, Inc. _aNew York _c1998 |
||
| 300 | _axvi, 496 p. | ||
| 365 |
_aUSD _b22.95 |
||
| 520 | _aThis clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly. | ||
| 650 |
_aMathematical optimization _9647 |
||
| 650 |
_aComputational complexity _93745 |
||
| 650 |
_aCombinatorial optimization _93746 |
||
| 650 |
_aCombinatorial analysis _93747 |
||
| 700 |
_aSteiglitz, Kenneth _93748 |
||
| 942 |
_2ddc _cBK |
||