
Integer and Combinatorial Optimization
Wiley (Publisher)
Published on 30. June 1988
Book
Hardback
782 pages
978-0-471-82819-8 (ISBN)
Article exhausted; check different version
Description
This advanced text/reference presents the mathematical foundations of integer and combinatorial optimization models and the algorithms that can be used to solve a variety of problems in resource allocation, location, distribution, scheduling and production. Chapters on polyhedral theory and model formulation with integer variables are included. Part 1 covers linear programming, graphs and networks and computational complexity. Part 2 covers integer programming, including duality, relaxation and strong cutting planes, and presents algorithms. Part 3 addresses combinatorial optimization, including 0-1 matrices, matching, and submodular function optimization. The book contains many examples and applications.
More details
Series
Language
English
Place of publication
New York
United States
Publishing group
John Wiley and Sons Ltd
Target group
College/higher education
Professional and scholarly
Illustrations
Ill.
Dimensions
Height: 260 mm
Width: 200 mm
Weight
1417 gr
ISBN-13
978-0-471-82819-8 (9780471828198)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

Laurence A. Wolsey | George L. Nemhauser
Integer and Combinatorial Optimization
E-Book
08/2014
Wiley
€155.99
Available for download

Laurence A. Wolsey | George L. Nemhauser
Integer and Combinatorial Optimization
E-Book
08/2014
Wiley
€155.99
Available for download

Laurence A. Wolsey | George L. Nemhauser
Integer and Combinatorial Optimization
Book
07/1999
Wiley
€187.50
Shipment within 10-20 days
Content
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; The Matching Problem; Matroid and Submodular Function Optimization; Notes; Exercises.