Description

Book Synopsis
Discrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods.

Table of Contents
FOUNDATIONS.

The Scope of Integer and Combinatorial Optimization.

Linear Programming.

Graphs and Networks.

Polyhedral Theory.

Computational Complexity.

Polynomial-Time Algorithms for Linear Programming.

Integer Lattices.

GENERAL INTEGER PROGRAMMING.

The Theory of Valid Inequalities.

Strong Valid Inequalities and Facets for Structured Integer Programs.

Duality and Relaxation.

General Algorithms.

Special-Purpose Algorithms.

Applications of Special- Purpose Algorithms.

COMBINATORIAL OPTIMIZATION.

Integral Polyhedra.

Matching.

Matroid and Submodular Function Optimization.

References.

Indexes.

Integer and Combinatorial Optimization

    Product form

    A Paperback / softback by Laurence A. Wolsey, George L. Nemhauser

    £141.26

    Includes FREE delivery

    RRP £156.95 – you save £15.69 (9%)

    Order before 4pm today for delivery by Sat 5 Sep 2026.

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Integer and Combinatorial Optimization by Laurence A. Wolsey

      Book details

      Publisher John Wiley & Sons Inc
      Published 22 July 1999
      ISBN-13 9780471359432
      978-0471359432
      ISBN-10 0471359432
      Also in:
      Mathematics Combinatorics and graph theory Mathematical foundations

      Description

      Book Synopsis
      Discrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods.

      Table of Contents
      FOUNDATIONS.

      The Scope of Integer and Combinatorial Optimization.

      Linear Programming.

      Graphs and Networks.

      Polyhedral Theory.

      Computational Complexity.

      Polynomial-Time Algorithms for Linear Programming.

      Integer Lattices.

      GENERAL INTEGER PROGRAMMING.

      The Theory of Valid Inequalities.

      Strong Valid Inequalities and Facets for Structured Integer Programs.

      Duality and Relaxation.

      General Algorithms.

      Special-Purpose Algorithms.

      Applications of Special- Purpose Algorithms.

      COMBINATORIAL OPTIMIZATION.

      Integral Polyhedra.

      Matching.

      Matroid and Submodular Function Optimization.

      References.

      Indexes.

      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