Combinatorial Optimization

Packing and Covering

Gérard Cornuéjols (Autor)

Buch | Softcover

144 Seiten

1987
Society for Industrial & Applied Mathematics,U.S. (Verlag)
978-0-89871-481-4 (ISBN)

Artikel merken

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.

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

Reihe/Serie	CBMS-NSF Regional Conference Series in Applied Mathematics
Verlagsort	New York
Sprache	englisch
Maße	172 x 251 mm
Gewicht	269 g
Themenwelt	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
	Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik
	Mathematik / Informatik ► Mathematik ► Graphentheorie
ISBN-10	0-89871-481-8 / 0898714818
ISBN-13	978-0-89871-481-4 / 9780898714814
Zustand	Neuware