SIAM Homepage | Search Catalog | New Books | Author Index | Series Index | Title Index | View My Shopping Cart

The catalog and shopping cart are hosted for SIAM by EasyCart. Your transaction is secure. If you have any questions about your order, contact

Purchase Now!

Combinatorial Optimization: Packing and CoveringCombinatorial Optimization: Packing and Covering

Gérard Cornuéjols

CBMS-NSF Regional Conference Series in Applied Mathematics 74

This monograph presents new and elegant proofs of classical results and makes difficult results accessible. 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 integral, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integral 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 rich area of discrete mathematics. This monograph presents several of these beautiful results as it introduces mathematicians to this active area of research.

To encourage research on the many intriguing open problems that remain, Dr. Cornuéjols is offering a $5000 prize to the first paper solving or refuting each of the 18 conjectures described in the book. To claim one of the prizes mentioned in the preface, papers must be accepted by a quality refereed journal (such as Journal of Combinatorial Theory B, Combinatorica, SIAM Journal on Discrete Mathematics, or others to be determined by Dr. Cornuéjols) before 2020. Claims must be sent to Dr. Cornuéjols at Carnegie Mellon University during his lifetime.


This book is appropriate for graduate students and faculty members in applied mathematics, operations research, and computer science.


Preface; Chapter 1: Clutters; Chapter 2: T-Cuts and T-Joins; Chapter 3: Perfect Graphs and Matrices; Chapter 4: Ideal Matrices; Chapter 5: Odd Cycles in Graphs; Chapter 6: 0,+1 Matrices and Integral Polyhedra; Chapter 7: Signing 0,1 Matrices to Be Totally Unimodular or Balanced; Chapter 8: Decomposition by k-Sum; Chapter 9: Decomposition of Balanced Matrices; Chapter 10: Decomposition of Perfect Graphs; Bibliography; Index

2001 / xii + 132 pages / Softcover / ISBN-13: 978-0-898714-81-4 / ISBN-10: 0-89871-481-8 /
List Price $60.50 / SIAM/CBMS Member Price $42.35 / Order Code CB74
Quantity desired

Search our catalog for:

Shopping cart provided by:
Select quantity and list or member price and then click the "Click to Order" button to add books to your shopping cart.
Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Auckland, NZ.)