A core approach to the 0—1 equality knapsack problem

Journal of the Operational Research Society

Volumn 49, Issue 1, 1998, Pages 86-92

  Volgenant, A ^a   Marsman, S ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Heuristics; Integer programming; Knapsack problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; PERSONAL COMPUTERS; PROBLEM SOLVING; SORTING;

KNAPSACK PROBLEM; PARTITIONING METHODS;

INTEGER PROGRAMMING;

EID: 0031702718     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600488     Document Type: Article

References (10)

1. Karp RM (1972). Reducibility among combinatorial problems. In: Miller RE and Thatcher JW (eds). Complexity of Computer Computations. Plenum Press: New York.
2. Horowitz E and Sahni S (1974). Computing partitions with applications to the knapsack problem. J of the ACM 21: 277-292.
3. Martello S and Toth P (1977). An upper bound for the zero-one knapsack problem and a branch and bound algorithm. Eur J Opl Res 1: 169-175.
4. Ram B and Sarin S (1988). An algorithm for the 0-1 equality knapsack problem. J Opl Res Soc 39: 1045-1049.
5. Kaufman L, Plastria F and Tubeeckx S (1985). The zero-one knapsack problem with equality constraint. Eur J Opl Res 19: 384-389.
6. Volgenant A (1996). Linear and semi assignment problems: a core oriented approach. Comput & Opns Res 23: 917-932.
7. Balas E and Zemel E (1980). An algorithm for large zero-one knapsack problems. Opns Res 28: 1130-1154.
8. Fayard D and Plateau G (1982). An algorithm for the solution of the 0-1 knapsack problem. Computing 28: 269-287.
9. Martello S and Toth P (1990). Knapsack Problems, Algorithms and Computer Implementations. Wiley: Chichester.
10. Press WH, Flannery BP, Teukolsky SA and Vetterling WT (1989). Numerical Recipes in Pascal: The Art of Scientific Computing. Cambridge University Press: Cambridge.