| 000 | 00935 a2200229 4500 | ||
|---|---|---|---|
| 010 | _a 2002036693 | ||
| 020 | _a3540443894 (acidfree paper) | ||
| 050 | 0 | 0 | _aQA402.5 |
| 082 | 0 | 0 | _a519.64 |
| 090 |
_c30444 _d30444 |
||
| 100 | 1 | _aSchrijver, Alexander | |
| 546 | _aeng | ||
| 245 | 1 | b |
_aCombinatorial optimization: _bPolyhedra and efficiency _cAlexander Schrijver |
| 260 |
_aBerlin ; _aNew York: _bSpringer, _cc2003 |
||
| 300 |
_a3 v. (xxxvii, 1881 p.),+,1 CD _c24 cm |
||
| 440 | 0 |
_aAlgorithms and combinatorics _vvol. 24 |
|
| 500 | _aVolumul C: Disjoint Paths, Hypergraphs cuprinde si 1 CD, cu acelasi nr de inventar | ||
| 505 | 0 | _av. A. Paths, flows, matchings -- v. B. Matroids, trees, stable sets -- v. C. Disjoint paths, hypergraphs. | |
| 650 | 0 | _aCombinatorial optimization | |
| 856 | 4 | 2 |
_3Contributor biographical information _uhttp://www.loc.gov/catdir/enhancements/fy0813/2002036693-b.html |
| 942 |
_cCART _k519.64 _sEP _aIMAR |
||
| 999 |
_c30096 _d30096 |
||