A Surrogate cutting plane algorithm for all-integer programming
- 31 December 1985
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 12 (3) , 241-250
- https://doi.org/10.1016/0305-0548(85)90023-1
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A bounded dual (all‐integer) integer programming algorithm with an objective cutNaval Research Logistics Quarterly, 1983
- An advanced dual algorithm with constraint relaxation for all‐integer programmingNaval Research Logistics Quarterly, 1983
- A primal‐dual cutting‐plane algorithm for all‐integer programmingNaval Research Logistics Quarterly, 1981
- A Generated Cut for Primal Integer ProgrammingOperations Research, 1974
- A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General VariablesOperations Research, 1969
- Integer Linear Programming: A Study in Computational EfficiencyManagement Science, 1969
- A Simplified Primal (All-Integer) Integer Programming AlgorithmOperations Research, 1968
- Surrogate ConstraintsOperations Research, 1968