Description

Book Synopsis
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.

Combinatorial Optimization Packing and Covering

Product form

£58.05

Includes FREE delivery

RRP £64.50 – you save £6.45 (10%)

Order before 4pm today for delivery by Wed 21 Jan 2026.

A Paperback by Gérard Cornuéjols

1 in stock


    View other formats and editions of Combinatorial Optimization Packing and Covering by Gérard Cornuéjols

    Publisher: Society for Industrial and Applied Mathematics
    Publication Date: 1/1/1987
    ISBN13: 9780898714814, 978-0898714814
    ISBN10: 0898714818
    Also in:
    Combinatorics and graph theory

    Description

    Book Synopsis
    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.

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account