A first course in combinatorial optimization / Jon Lee.
Saved in:
Superior document: | Cambridge texts in applied mathematics |
---|---|
: | |
TeilnehmendeR: | |
Year of Publication: | 2004 |
Language: | English |
Series: | Cambridge texts in applied mathematics.
|
Online Access: | |
Physical Description: | xvi, 211 p. :; ill. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
LEADER | 01673nam a2200397Ia 4500 | ||
---|---|---|---|
001 | 500256650 | ||
003 | MiAaPQ | ||
005 | 20200520144314.0 | ||
006 | m o d | | ||
007 | cr cn||||||||| | ||
008 | 040106s2004 enka sb 001 0 eng d | ||
010 | |z 2004040681 | ||
020 | |z 0511187831 | ||
020 | |z 0521811511 | ||
020 | |z 0521010128 (pbk.) | ||
035 | |a (MiAaPQ)500256650 | ||
035 | |a (Au-PeEL)EBL256650 | ||
035 | |a (CaPaEBR)ebr10124656 | ||
035 | |a (OCoLC)80244805 | ||
040 | |a MiAaPQ |c MiAaPQ |d MiAaPQ | ||
050 | 4 | |a QA402.5 |b .L394 2004 | |
082 | 0 | 4 | |a 519.6/4 |2 22 |
100 | 1 | |a Lee, Jon, |d 1960- | |
245 | 1 | 2 | |a A first course in combinatorial optimization |h [electronic resource] / |c Jon Lee. |
260 | |a Cambridge, UK ; |a New York : |b Cambridge University Press, |c 2004. | ||
300 | |a xvi, 211 p. : |b ill. | ||
490 | 1 | |a Cambridge texts in applied mathematics | |
504 | |a Includes bibliographical references (p. 207-208) and indexes. | ||
505 | 0 | |a Polytopes 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 | |a Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. | ||
650 | 0 | |a Combinatorial optimization. | |
650 | 0 | |a Combinatorial analysis. | |
655 | 4 | |a Electronic books. | |
710 | 2 | |a ProQuest (Firm) | |
830 | 0 | |a Cambridge texts in applied mathematics. | |
856 | 4 | 0 | |u https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=256650 |z Click to View |