An Adaptive Group Theoretic Algorithm for Integer Programming Problems

Group theory is used to integrate a wide variety of integer programming methods into a common computational process. Included are group optimization algorithms, Lagrangian methods, the cutting plane method, and the method of surrogate constraints. These methods are controlled by a supervisor which performs four main functions: set-up, directed search, subproblem analysis, and prognosis. Some computational experience is given. One appendix contains an algorithm for dynamically solving unconstrained group problems. A second appendix gives an algorithm for solving zero-one group problems.

• 저널Management Science · 17(5) · 285–306
• 토픽Constraint Satisfaction and Optimization · Computer Networks and Communications
• DOI10.1287/mnsc.17.5.285
• 저자G. Anthony Gorry, Jeremy F. Shapiro