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 p...
Gespeichert in:
Veröffentlicht in: | Management science 1971-01, Vol.17 (5), p.285-306 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 0025-1909 1526-5501 |
DOI: | 10.1287/mnsc.17.5.285 |