Combinatorial Optimization: Packing and Covering - Brossura

Cornuéjols, Gérard

 
9780898714814: Combinatorial Optimization: Packing and Covering

Sinossi

New and elegant proofs of classical results and makes difficult results accessible.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.