A dynamic programming branch and bound algorithm for pure integer programming
- 31 December 1976
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 3 (1) , 27-38
- https://doi.org/10.1016/0305-0548(76)90004-6
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Discrete Dynamic Programming and Capital AllocationManagement Science, 1969
- Integer Linear Programming: A Study in Computational EfficiencyManagement Science, 1969
- An Extension of Lawler and Bell's Method of Discrete Optimization with Examples from Capital BudgetingManagement Science, 1968
- Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D ProjectsManagement Science, 1967
- Methods for the Solution of the Multidimensional 0/1 Knapsack ProblemOperations Research, 1967