| 000 | 01087nam a2200361Ia 4500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20220912144641.0 | ||
| 006 | a|||||r|||| 00| 0 | ||
| 007 | ta | ||
| 008 | 220909b |||||||| |||| 00| 0 eng d | ||
| 020 | _a9783540443896 (hbk) | ||
| 020 | _aSL01600036 | ||
| 024 | _a195215 | ||
| 037 | _b2469, 29/12/2015, New India Book Agency | ||
| 037 | _cTextual | ||
| 040 |
_aCSL _beng _cCSL |
||
| 041 | _aeng | ||
| 082 | _aB28931, P3.A | ||
| 100 | _aSchrijver Alexander | ||
| 245 | 0 | _aCombinatorial optimization: polyhedra and efficiency | |
| 260 |
_aNew York _bSpringer _c2003 |
||
| 300 | _axxxvii, 647p. ill. | ||
| 490 | _aAlgorithms and combinatorics; Vol.24 | ||
| 650 | _a Bidirected graphs | ||
| 650 | _a Disjoint paths | ||
| 650 | _a Upper and lower bounds | ||
| 650 | _aPreliminaries on graphs | ||
| 700 | _a Borodin Oleg Ed. | ||
| 700 | _a Ue Makoto Ed. | ||
| 700 | _aSchrijver Alexander | ||
| 942 |
_hB28931, P3.A _cTEXL _2CC |
||
| 999 |
_c14726 _d14726 |
||