A Branch and Bound Algorithm for the Knapsack Problem
Data up to Jan 2025
Total Citations Per Year
Abstract
References (10)
Applied Dynamic Programming.
1964 • 2,240 citations
A Linear Programming Approach to the Cutting-Stock Problem
1961 • 1,976 citations
Branch-and-Bound Methods: A Survey
1966 • 1,915 citations
A Linear Programming Approach to the Cutting Stock Problem—Part II
1963 • 1,088 citations
An Algorithm for the Traveling Salesman Problem
1963 • 1,029 citations
Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems
1965 • 591 citations
A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
1965 • 325 citations
Flow Networks and Combinatorial Operations Research
1966 • 95 citations
A Method for Allocating Funds to Investment Projects when Returns are Subject to Uncertainty
1964 • 46 citations
A Note on the Additive Algorithm of Balas
1965 • 26 citations