Computational aspects of hard knapsack problems

Nonlinear Analysis, Theory, Methods and Applications

Volumn 47, Issue 8, 2001, Pages 5547-5558

  Caccetta, L ^a,b   Kulanoot, A ^a,b  

^a CURTIN UNIVERSITY   (Australia)

^b NONE

Author keywords

Branch and bound; Combinatorial optimization; Dynamic programming; Knapsack problem

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; PROBLEM SOLVING;

KNAPSACK PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0035421620     PISSN: 0362546X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0362-546X(01)00658-7     Document Type: Article

References (35)

1. An Algorithm for Large Zero-One Knapsack Problems
2. Algorithms for some hard knapsack problems
3. A method for allocating funds to investment projects when returns are subject to uncertainty
4. Exact methods for the knapsack problem and its generalizations
5. An algorithm for the solution of the 0-1 knapsack problem
6. A linear programming approach to the cutting stock problem II
7. The theory and computation of knapsack functions
8. On the equivalent knapsack problems
9. A branch search algorithm for the knapsack problem
10. Operations research in the national planning of underdeveloped countries
11. Computing partitions with applications to the knapsack problem
12. A reduction algorithm for Zero-one single knapsack problems
13. Solution of the Lorie-Savage and similar integer programming problems by the generalized lagrangian multiplier method
14. A branch and bound algorithm for the knapsack problem
15. Dynamic programming and tight bounds for the 0-1 knapsack problem
16. An upper bound for the zero-one knapsack problem and a branch and bound algorithm
17. A new algorithm for the 0-1 knapsack problem
18. An exact algorithm for large unbounded knapsack problems
19. Upper bounds and algorithms for hard 0-1 knapsack problems
20. An improved upper bound for the zero-one knapsack problem: A note on the paper by Martello and Toth
21. An efficient algorithm for the 0-1 knapsack problem
22. An expanding-core algorithm for the exact 0-1 knapsack problem
23. A minimal algorithm for the 0-1 knapsack problem
24. A fast algorithm for strongly correlated knapsack problems
25. Knapsack problems
26. The multiple-choice knapsack problem