01772nam a2200397Ia 4500 EBC256650 MiAaPQ 20250821100744.0 m o d | cr cnu|||||||| 040106s2004 enka ob 001 0 eng d 9780511187834 (electronic bk.) 9780521811514 (print) (MiAaPQ)EBC256650 (Au-PeEL)EBL256650 (CaPaEBR)ebr10124656 (OCoLC)80244805 MiAaPQ eng rda pn MiAaPQ MiAaPQ QA402.5 .L394 2004 519.6/4 22 Lee, Jon, 1960- 100331 A first course in combinatorial optimization [electronic resource] / Jon Lee. Cambridge, UK ; New York : Cambridge University Press, 2004. xvi, 211 p. : ill. Cambridge texts in applied mathematics Includes bibliographical references (p. 207-208) and indexes. 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. Electronic reproduction. Ann Arbor, MI : ProQuest, 2018. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. Combinatorial optimization. 100332 Combinatorial analysis. 100333 Electronic books. 35142 ProQuest (Firm) 100334 ProQuest (Firm) Cambridge texts in applied mathematics. 100335 https://ebookcentral.proquest.com/lib/kuct-ebooks/detail.action?docID=256650 Click to View 231470 231470