A Note on the Max-Min 0-1 Knapsack Problem

Journal of Combinatorial Optimization

Volumn 3, Issue 1, 1999, Pages 89-94

  Iida, Hiroshi ^a  

^a OTARU UNIVERSITY OF COMMERCE   (Japan)

Author keywords

Branch and bound; Knapsack problem; Linear programming relaxation; Surrogate relaxation

Indexed keywords

EID: 0042044313     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009821323279     Document Type: Article

References (3)

1. G.B. Dantzig, "Discrete variable extremum problems," Operations Res., vol. 5, pp. 266-277, 1957.
2. H. Iida, "On solving the max-min 0-1 knapsack problem, Research Report: IS-RR-97-0025F," JAIST Hokuriku, 923-1292 Japan, 1997.
3. G. Yu, "On the max-min 0-1 knapsack problem with robust optimization applications," Operations Res., vol. 44, no. 2, pp. 407-415, 1996.