01772nam a2200397Ia 4500001001000000003000700010005001700017006001900034007001500053008004100068020003600109020002700145035002200172035002300194035002500217035002000242040004100262050002400303082001600327100002900343245008400372260006800456300002400524490004300548504006600591505025000657590014700907650004001054650003601094655002901130710002801159797002001187830005201207856009601259999001901355EBC256650MiAaPQ20250821100744.0m     o  d |      cr cnu||||||||040106s2004    enka    ob    001 0 eng d  a9780511187834q(electronic bk.)  z9780521811514q(print)  a(MiAaPQ)EBC256650  a(Au-PeEL)EBL256650  a(CaPaEBR)ebr10124656  a(OCoLC)80244805  aMiAaPQbengerdaepncMiAaPQdMiAaPQ 4aQA402.5b.L394 20040 a519.6/42221 aLee, Jon,d1960-910033112aA first course in combinatorial optimizationh[electronic resource] /cJon Lee.  aCambridge, UK ;aNew York :bCambridge University Press,c2004.  axvi, 211 p. :bill.1 aCambridge texts in applied mathematics  aIncludes bibliographical references (p. 207-208) and indexes.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.  aElectronic reproduction. Ann Arbor, MI : ProQuest, 2018. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. 0aCombinatorial optimization.9100332 0aCombinatorial analysis.9100333 4aElectronic books.9351422 aProQuest (Firm)91003342 aProQuest (Firm) 0aCambridge texts in applied mathematics.910033540uhttps://ebookcentral.proquest.com/lib/kuct-ebooks/detail.action?docID=256650zClick to View  c231470d231470