The bound improving sequence algorithm
- 31 May 1985
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 4 (1) , 27-30
- https://doi.org/10.1016/0167-6377(85)90047-1
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- An upper bound for the zero-one knapsack problem and a branch and bound algorithmEuropean Journal of Operational Research, 1977