Combinatorial Optimization: Packing and Covering - Brossura

Cornuéjols, Gérard

Brossura

ISBN 10: 0898714818 ISBN 13: 9780898714814

Casa editrice: Society for Industrial and Applied Mathematics, 1987

Riassunto

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.

Su questo libro

Descrizione del libro

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.

Contenuti

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.

Dettagli dell?edizione

• Editore: Society for Industrial and Applied Mathematics
• Data di pubblicazione: 1987
• ISBN 10: 0898714818
• ISBN 13: 9780898714814
• Rilegatura: Copertina flessibile
• Lingua: Inglese
• Numero di pagine: 144