
- 472 pages
- English
- PDF
- Available on iOS & Android
Discrete Optimization
About this book
This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynomial algorithms are introduced--models using matroids and linear programming. Further chapters treat the major non-polynomial algorithms: branch-and-bound and cutting planes. The text concludes with a chapter on heuristic algorithms.Several appendixes are included which review the fundamental ideas of linear programming, graph theory, and combinatorics--prerequisites for readers of the text. Numerous exercises are included at the end of each chapter.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Front Cover
- Discrete Optimization
- Copyright Page
- Table of Contents
- Dedication
- Preface
- Chapter 1. Introduction to Discrete Optimization
- Chapter 2. Computational Complexity
- Chapter 3. Polynomial Algorithms—Matroids
- Chapter 4. Polynomial Algorithms—Linear Programming
- Chapter 5. Nonpolynomial Algorithms—Partial Enumeration
- Chapter 6. Nonpolynomial Algorithms—Polyhedral Description
- Chapter 7. Nonexact Algorithms
- Appendix A: Vectors, Matrices and Convex Sets
- Appendix B: Graph Theory Fundamentals
- Appendix C: Linear Programming Fundamentals
- References
- Index