Integer and Combinatorial Optimization by Laurence A. WolseyInteger and Combinatorial Optimization by Laurence A. Wolsey

Integer and Combinatorial Optimization

byLaurence A. Wolsey, George L. Nemhauser

Paperback | July 8, 1999

Pricing and Purchase Info

$215.41 online 
$226.80 list price save 5%
Earn 1,077 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION

"This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima

"A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Reviews

"[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews

"This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society

"This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London

Also of interest . . .

INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp.
Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive ...
Loading
Title:Integer and Combinatorial OptimizationFormat:PaperbackDimensions:784 pages, 10 × 7.1 × 1.6 inPublished:July 8, 1999Publisher:WileyLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0471359432

ISBN - 13:9780471359432

Reviews

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.

From Our Editors

Many diverse fields such as operations research, management science, engineering and mathematics depend on discrete optimization models to solve different problems. Authors George Nemhauser and Laurence Wolsey offer readers a book that many professionals in the field consider to be the mathematical bible. With more than 700 references, Integer and Combinatorial Optimization provides scientists, engineers and even quality control and assurance experts with vital foundations for problem solving. A hands-on reference, it includes a multitude of problems and model formulations.