Integer and combinatorial optimization
Author(s)
Bibliographic Information
Integer and combinatorial optimization
（Wiley-Interscience series in discrete mathematics and optimization）
Wiley, c1999
- : pbk
Available at 37 libraries
Note
Includes bibliographical references (p. 721-747) and indexes
Description and Table of Contents
Description
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.
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.
by "Nielsen BookData"