PC-oriented algorithms for the knapsack problem
- 102 Downloads
The paper presents branch and bound algorithms for solving 0–1 knapsack problems on personal computers. Some improvements to the existing methods are described and fixed point calculations are introduced. Results of our computational experiment are reported.
Keywordsknapsack problem branch and bound reduction fixed point calculations
Unable to display preview. Download preview PDF.
- S. Martello, P. Toth (1987), "Algorithms for Knapsack Problems" in S. Martello, G. Laporte, M. Minoux and C. Ribeiro (Eds.), Surveys in Combinatorial Optimization, Annals of Discrete Mathematics 31, North-Holland, Amsterdam.Google Scholar
- D. Pisinger, S. Walukiewicz (1989), "Experiments with 0–1 Knapsack Algorithms", Research Report, Systems Research Institute Polish, Academy of Sciences, Warsaw.Google Scholar