An implicit branch-and-bound algorithm for mixed-integer-linear programming
- 31 December 1990
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 17 (5) , 457-464
- https://doi.org/10.1016/0305-0548(90)90050-h
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The mixed cutting plane algorithm for all-integer programmingComputers & Operations Research, 1986
- An advanced start algorithm for all-integer programmingComputers & Operations Research, 1985
- 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
- Integer Linear Programming: A Study in Computational EfficiencyManagement Science, 1969
- A Simplified Primal (All-Integer) Integer Programming AlgorithmOperations Research, 1968
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958