Integer and combinatorial optimization

Front Cover
Wiley, 1988 - Mathematics - 763 pages
1 Review
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.

From inside the book

What people are saying - Write a review

Review: Integer and Combinatorial Optimization

User Review  - Ehsan - Goodreads

classic book on COP and IP. A must have for every researcher in the field of discrete optimization, specially for grads in maths, OR, and Eng. Read full review

Related books

Contents

Graphs and Networks
50
Strong Valid Inequalities and Facets for Structured Integer Programs
259
Valid Inequalities for the 01 Knapsack Polytope
265
Copyright

61 other sections not shown

Common terms and phrases

Bibliographic information