Integer Programming Algorithms: A Framework and State-of-the-Art Survey
Arthur M. Geoffrion, Roy E. Marsten · Management Science · 1972
A unifying framework is developed to facilitate the understanding of most known computational approaches to integer programming. A number of currently operational algorithms are related to this framework, and prospects for future progress are assessed.
Cited by 350 works. doi:10.1287/mnsc.18.9.465
Authors
References
- An Algorithm for the Traveling Salesman Problem
- An Automatic Method for Solving Discrete Programming Problems
- Partitioning procedures for solving mixed-variables programming problems
- Branch-and-Bound Methods: A Survey
- Optimization Theory of Large Systems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Integer Programming: Methods, Uses, Computations
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Integer Programming by Implicit Enumeration and Balas’ Method