| 000 | 01178nam a2200325 i 4500 | ||
|---|---|---|---|
| 001 | 16800 | ||
| 005 | 20260226113434.0 | ||
| 008 | 021021s2003 gw a b 001 0 eng | ||
| 020 | _a3540443894 | ||
| 035 | _a(OCoLC) | ||
| 040 |
_aBAUN _beng _cBAUN _erda |
||
| 041 | 0 | _aeng | |
| 049 | _aBAUN_MERKEZ | ||
| 050 | 0 | 4 |
_aQA402.5 _b.S3535 2003 |
| 100 | 1 |
_aSchrijver, A. _994423 _eaut |
|
| 245 | 1 | 0 |
_aCombinatorial optimization : _bpolyhedra and efficiency / _cAlexander Schrijver. |
| 264 | 1 |
_aBerlin ; _aNew York : _bSpringer, _c[2003] |
|
| 264 | 4 | _c©2003 | |
| 300 |
_a3 volumes (xxxvii, 1881 pages) : _billustrations ; _c24 cm. |
||
| 336 |
_aunspecified _bzzz _2rdacontent |
||
| 337 |
_aunmediated _bn _2rdamedia |
||
| 338 |
_avolume _bnc _2rdacarrier |
||
| 490 | 1 |
_aAlgorithms and combinatorics, _x0937-5511 ; _v24 |
|
| 504 | _aIncludes bibliographical references (pages [1463]-1766) and indexes. | ||
| 505 | 0 |
_av. A. Paths, flows, matchings _t-- volume B. Matroids, trees, stable sets _t-- volume C. Disjoint paths, hypergraphs. |
|
| 650 | 0 |
_aCombinatorial optimization. _976726 |
|
| 830 | 0 |
_9108494 _aAlgorithms and combinatorics, _v24 |
|
| 900 | _bsatın | ||
| 942 |
_2lcc _cKT |
||
| 999 |
_c14321 _d14321 |
||