Combinatorial Optimization: Packing and Covering

Gerard Cornuejols

ISBN 10: 0898714818 / ISBN 13: 9780898714814

Editore: Society for Industrial & Applied Mathematics,U.S., 1987

Riguardo questo articolo

New copy - Usually dispatched within 4 working days. 299. Codice articolo B9780898714814

Dati bibliografici

Titolo: Combinatorial Optimization: Packing and ...

Casa editrice: Society for Industrial & Applied Mathematics,U.S.

Data di pubblicazione: 1987

Legatura: Paperback

Condizione: New

Descrizione articolo

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.

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.