ISBN: | 9780975914625 |
Publisher: | Dynamic Ideas |
Published: | 1 June, 2005 |
Format: | Hardcover |
Language: | English |
The book provides a unified, insightful, and modern treatment of the theory of integer optimization. The book is used in the doctoral level course, "Integer and Combinatorial Optimization" at the Massachusetts Institute of Technology. For solutions to exercises and other instructor resources, please contact Dimitris Bertsimas (dbertsim@mit.edu). The chapters of the book are logically organized in four parts: Part I: Formulations and relaxations includes Chapters 1-5 and discusses how to formulate integer optimization problems, how to enhance the formulations to improve the quality of relaxations, how to obtain ideal formulations, the duality of integer optimization and how to solve the resulting relaxations both practically and theoretically. Part II: Algebra and geometry of integer optimization includes Chapters 6-8 and develops the theory of lattices, oulines ideas from algebraic geometry that have had an impact on integer optimization, and most importantly discusses the geometry of integer optimization, a key feature of the book. These chapters provide the building blocks for developing algorithms. Part III: Algorithms for integer optimization includes Chapters 9-12 and develops cutting plane methods, integral basis methods, enumerative and heuristic methods and approximation algorithms. The key characteristic of our treatment is that our development of
Shop Preferences
Customize which shops to display. You can include the following shops by logging in to change your settings.