A Course in Combinatorial Optimization by Alexander Schrijver
Publisher: University of Amsterdam 2012
Number of pages: 221
Contents: Shortest paths and trees; Polytopes, polyhedra, Farkas' lemma, and linear programming; Matchings and covers in bipartite graphs; Menger's theorem, flows, and circulations; Nonbipartite matching; Problems, algorithms, and running time; Cliques, stable sets, and colourings; Integer linear programming and totally unimodular matrices; Multicommodity flows and disjoint paths; Matroids.
Mathematics Applied Optimization Combinatorial