Stock image for illustration purposes only - book cover, edition or condition may vary.
Combinatorial Optimization
G. Cornuejols
€ 93.49
FREE Delivery in Ireland
Description for Combinatorial Optimization
Paperback.
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 ... Read more
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 ... Read more
Product Details
Format
Paperback
Publication date
1987
Publisher
Society for Industrial & Applied Mathematics,U.S. United States
Number of pages
144
Condition
New
Number of Pages
144
Place of Publication
New York, United States
ISBN
9780898714814
SKU
V9780898714814
Shipping Time
Usually ships in 7 to 11 working days
Ref
99-1
Reviews for Combinatorial Optimization