Combinatorial Optimization

Name: Combinatorial Optimization
Brand: SIAM - SOCIETY FOR INDUSTRIAL AND APPLIED
Price: 157.75 AUD
Availability: BackOrder

Packing and Covering

By: Gerard Cornuejols

Write A Review

Paperback | 29 June 2001

At a Glance

Paperback
143 Pages

Dimensions(cm)
22.9 x 15.2

Paperback

RRP $164.00

$157.75

or 4 interest-free payments of $39.44 with

Available for Backorder. We will order this from our supplier however there isn't a current ETA.

New proofs of classical results are presented and difficult results are made accessible in this monograph. 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 integer, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integer 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 area of discrete mathematics. This monograph presents several of these results as it introduces mathematicians to this active area of research.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.