| 000 | 01612nam a2200361Ia 4500 | ||
|---|---|---|---|
| 001 | ebr10124656 | ||
| 003 | CaPaEBR | ||
| 006 | m u | ||
| 007 | cr cn||||||||| | ||
| 008 | 040106s2004 enka sb 001 0 eng d | ||
| 010 | _z 2004040681 | ||
| 020 | _z0511187831 | ||
| 020 | _z0521811511 | ||
| 020 | _z0521010128 (pbk.) | ||
| 040 |
_aCaPaEBR _cCaPaEBR |
||
| 035 | _a(OCoLC)80244805 | ||
| 050 | 1 | 4 |
_aQA402.5 _b.L394 2004eb |
| 082 | 0 | 4 |
_a519.6/4 _222 |
| 100 | 1 |
_aLee, Jon, _d1960- |
|
| 245 | 1 | 2 |
_aA first course in combinatorial optimization _h[electronic resource] / _cJon Lee. |
| 260 |
_aCambridge, UK ; _aNew York : _bCambridge University Press, _c2004. |
||
| 300 |
_axvi, 211 p. : _bill. |
||
| 490 | 1 | _aCambridge texts in applied mathematics | |
| 504 | _aIncludes bibliographical references (p. 207-208) and indexes. | ||
| 505 | 0 | _aPolytopes and Linear Programming -- 1. Matroids and the Greedy Algorithm -- 2. Minimum-Weight Dipaths -- 3. Matroid Intersection -- 4. Matching -- 5. Flows and Cuts -- 6. Cutting Planes -- 7. Branch-&-Bound -- 8. Optimizing Submodular Functions. | |
| 533 |
_aElectronic reproduction. _bPalo Alto, Calif. : _cebrary, _d2009. _nAvailable via World Wide Web. _nAccess may be limited to ebrary affiliated libraries. |
||
| 650 | 0 | _aCombinatorial optimization. | |
| 650 | 0 | _aCombinatorial analysis. | |
| 655 | 7 |
_aElectronic books. _2local |
|
| 710 | 2 | _aebrary, Inc. | |
| 830 | 0 | _aCambridge texts in applied mathematics. | |
| 856 | 4 | 0 |
_uhttp://site.ebrary.com/lib/rucke/Doc?id=10124656 _zAn electronic book accessible through the World Wide Web; click to view |
| 999 |
_c108977 _d108977 |
||