Integer and Combinatorial Optimization (Wiley Series in Discrete Mathematics and Optimization) [Hardcover]

Laurence A. Wolsey (Author), George L. Nemhauser (Author)

Book Description

Publication Date: June 1988 | ISBN-10: 047182819X | ISBN-13: 978-0471828198 | Edition: 1

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.

Editorial Reviews

From the Publisher

This advanced text/reference is the most current, comprehensive treatment on the topic available. Presents the mathematical foundations of integer and combinatorial optimization models and the algorithms that can be used to solve a rich variety of problems in resource allocation, location, distribution, scheduling, and production. Includes chapters on polyhedral theory and model formulation with integer variables. Part I covers linear programming, graphs and networks, and computational complexity. Part II covers integer programming, including duality, relaxation and strong cutting planes, and presents algorithms. Part III addresses combinatorial optimization, including 0-1 matrices, matching, and submodular function optimization. Contains many examples and applications.

From the Back Cover

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.

Product Details

• Hardcover: 784 pages
• Publisher: Wiley-Interscience; 1 edition (June 1988)
• Language: English
• ISBN-10: 047182819X
• ISBN-13: 978-0471828198
• Product Dimensions: 10.1 x 7.3 x 1.8 inches
• Shipping Weight: 3.4 pounds
• Average Customer Review: 4.9 out of 5 stars  See all reviews (7 customer reviews)
• Amazon Best Sellers Rank: #1,859,470 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

8 of 9 people found the following review helpful:

5.0 out of 5 stars One of the best..., July 18, 2002

By 

Sharath Bulusu (London) - See all my reviews
(REAL NAME)   

This review is from: Integer and Combinatorial Optimization (Paperback)

I first used this book as a text for a graduate course in Integer Programming. At first it seemed to be a very poorly organized book, but as I read it and grew familiar with the subject, I realized that this is a hybrid textbook-handbook. Though the title says "Integer and Combinatorial", the authors go a step ahead and present topics in advanced linear programming, computational complexity, polyhedral theory in a fashion appropriate to the learning of this subject. The exercises are challenging and it has a very good list of references (only up to 1988). Our professor had to supplement the text with recent papers to cover the latest advances. My only complaint is that model formulation could have been dealt with in more detail. You might want to use HP Williams' "Model Building in Mathematical Programming" to look up good Math Prog models.
Though this is an excellent book in all respects, I would recommend Papadimitriou's older book on combinatorial optimization for a good discussion of P, NP problems and decision / optimization problems.

1 of 1 people found the following review helpful:

5.0 out of 5 stars Great MIP handbook, December 1, 2008

By 

Joc (USA) - See all my reviews

This review is from: Integer and Combinatorial Optimization (Paperback)

This book provides the basis of integer programming and mixed integer programming. It focus on the mathematical programming to discuss the combinatorial optimization, not the graph theory way.

For the introduction level, Wolsey's book is better.

4 of 6 people found the following review helpful:

4.0 out of 5 stars great book, December 29, 2001

By 

"aggieramki" (Texas, USA) - See all my reviews

This review is from: Integer and Combinatorial Optimization (Paperback)

Nemhauser is a great professor and this book is text book for IP. But this book requires that you are familiar with Linear programming. So read this book only after you had LP. Bertsimas book is really good for Lp. Or even Bazaara's book is a goo start.

This book starts with the mathematical basics behind linear programming and develops on these introducing new techniques like Bender's decomposition, various cuts, etc. The way the mathematics is dealt is flawless but I thought the methods required more examples for better understanding. But ofcourse the book had to be concise....

I have no opinion on the combinatorial optimisation part.