01557aam a2200169 4500008004500000020001800045082001700063100001300080245004900093260004700142300006100189440004300250520100900293650003101302650002701333650002701360200105b 2004 ||||| |||| 00| 0 eng d a9780521010122 a519.64bL3F4 aLee, Jon aA first course in combinatorial optimization bCambridge University Pressc2004aNew York axvi, 211 p.bIncludes bibliographic references and index aCambridge texts in applied mathematics aA First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.
https://www.cambridge.org/core/books/first-course-in-combinatorial-optimization/64736ECBD0D1A72B1D577EA01296CE23#fndtn-information aCombinatorial optimization aCombinatorial analysis aComputational Geometry