Wolsey / Nemhauser Integer and Combinatorial Optimization

1. Auflage 2014
ISBN: 978-1-118-62725-9
Verlag: John Wiley & Sons
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)

E-Book, Englisch, 784 Seiten, E-Book

Reihe: Wiley-Interscience Series in Discrete Mathematics and Optimization

Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION

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

"A unifying approach to optimization problems is to formulate themlike linear programming problems, while restricting some or all ofthe variables to the integers. This book is an encyclopedicresource for such formulations, as well as for understanding thestructure of and solving the resulting integer programmingproblems."-Computing Reviews

"[This book] can serve as a basis for various graduate courses ondiscrete optimization as well as a reference book for researchersand practitioners."-Mathematical Reviews

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

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

Also of interest . . .

INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive andself-contained, this intermediate-level guide to integerprogramming provides readers with clear, up-to-date explanations onwhy some problems are difficult to solve, how techniques can bereformulated to give better results, and how mixed integerprogramming systems can be used more effectively. 1998(0-471-28366-5) 260 pp.

Autoren/Hrsg.

Wolsey, Laurence A.

Nemhauser, George L.

Inhaltsverzeichnis

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 IntegerPrograms.
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.