Integer and Combinatorial Optimization (Wiley Series in Discrete Mathematics and Optimization)

Wolsey, Laurence A.; Nemhauser, George L.

ISBN 10: 047182819X / ISBN 13: 9780471828198

Published by Wiley-Interscience, 1988

About this Item

Seller Inventory # Scanned047182819X

Bibliographic Details

• Title: Integer and Combinatorial Optimization (Wiley Series in Discrete Mathematics and Optimization)
• Publisher: Wiley-Interscience
• Publication Date: 1988
• Language: English
• ISBN 10: 047182819X
• ISBN 13: 9780471828198
• Binding: Hardcover

About this title

Synopsis

This advanced text/reference presents the mathematical foundations of integer and combinatorial optimization models and the algorithms that can be used to solve a variety of problems in resource allocation, location, distribution, scheduling and production. Chapters on polyhedral theory and model formulation with integer variables are included. Part 1 covers linear programming, graphs and networks and computational complexity. Part 2 covers integer programming, including duality, relaxation and strong cutting planes, and presents algorithms. Part 3 addresses combinatorial optimization, including 0-1 matrices, matching, and submodular function optimization. The book 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.