On dominated terms in the general knapsack problem

Operations Research Letters

Volumn 21, Issue 1, 1997, Pages 31-37

  Zhu, Nan ^a   Broughan, Kevin ^a  

^a UNIVERSITY OF WAIKATO   (New Zealand)

Author keywords

Dominated term; Knapsack problem; Representation

Indexed keywords

EID: 0042440485     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(97)00018-7     Document Type: Article

References (8)

1. D.A. Babayev, S.S. Mardanov, Reducing the number of variables in integer and linear programming problems, Comput. Optim. Appl. 3 (1994) 99-109.
2. K. Dudziński, A note on dominance relation in unbounded knapsack problems, Oper. Res. Lett. 10 (1991) 417-419.
3. S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester, 1990.
4. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
5. G.L. Nemhauser, The age of optimization: solving large-scale real-world problems, Oper. Res. 42 (1994) 5-13.
6. D. Pisinger, Dominance relations in unbounded knapsack problems, Technical Report No. 94/33, DIKU, Copenhagen, Denmark.
7. H.H. Yanasse, N.Y. Soma, A new enumeration scheme for the knapsack problem, Discrete Appl. Math. 18 (1987) 235-245.
8. N. Zhu, On the relationship between the knapsack problem and the group knapsack problem, Technical Report No. 26, ISOR, Wellington, NZ, March, 1993.