Combinatorial Optimization: Packing and Covering

New proofs of classical results are presented and difficult results are made accessible in this monograph. The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integer, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integer optimal solutions. Under which conditions do such integrality conditions hold? This question is of both theoretical and practical interest. Min-max theorems, polyhedral combinatorics and graph theory all come together in this area of discrete mathematics. This monograph presents several of these results as it introduces mathematicians to this active area of research.