The reduced cost branch and bound algorithm for mixed integer programming
- 31 December 1985
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 12 (2) , 139-149
- https://doi.org/10.1016/0305-0548(85)90039-5
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- An ideal column algorithm for integer programs with special ordered sets of variablesMathematical Programming, 1983
- Branch and Bound Methods for Multi-Item SchedulingOperations Research, 1981
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- Zero-one programming with many variables and few constraintsEuropean Journal of Operational Research, 1978
- Experiments in mixed-integer linear programming using pseudo-costsMathematical Programming, 1977
- Practical Solution of Large Mixed Integer Programming Problems with UmpireManagement Science, 1974
- Elements of Large-Scale Mathematical Programming Part I: ConceptsManagement Science, 1970