Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem

Operations Research Letters

Volumn 26, Issue 2, 2000, Pages 55-66

  Güntzer, Michael M ^a   Jungnickel, Dieter ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

GREEDY ALGORITHMS; KNAPSACK PROBLEM; SUBSET-SUM PROBLEM;

APPROXIMATION THEORY;

EID: 0343517748     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00066-8     Document Type: Article

References (4)

1. Balas E., Zemel E. An algorithm for large zero-one Knapsack problems. Oper. Res. 28:1980;1130-1154.
2. Labbé M., Schmeichel E.F., Hakimi S.L. Approximation algorithms for the capacitated plant allocation problem. Oper. Res. Lett. 15:1994;115-126.
3. Lai Tsung-Chyan Worst-case analysis of greedy algorithms for the unbounded Knapsack, subset-sum and partition problems. Oper. Res. Lett. 14:1993;215-220.
4. S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, West Sussex, 1990.