Linear And Combinatorial Optimization
Mathematical and computational aspects of linear programming and combinatorial optimization. Linear optimization is introduced by presenting solution techniques (primal and dual simplex) and studying geometric properties and duality for linear systems of inequalities. Asics of combinatorial optimization, including trees, paths, flows, matchings, and matroids, and the corresponding algorithms are presented.