A First Course in Combinatorial Optimization

This text is for a one-semester introductory graduate course for students of operations research, mathematics, and computer science covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. The author focuses on the key mathematical ideas that lead to useful models and algorithms.