Heuristic and reduction algorithms for the knapsack sharing problem

Computers and Operations Research

Volumn 24, Issue 10, 1997, Pages 961-967

  Yamada, Takeo ^a   Futakawa, Mayumi ^a  

^a NATIONAL DEFENSE ACADEMY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; STATISTICAL METHODS;

KNAPSACK SHARING PROBLEM (KP);

OPERATIONS RESEARCH;

EID: 0031259140     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(97)00009-9     Document Type: Article

References (10)

1. Brown, J. R., The knapsack sharing problem. Operations Research , 1979, 27, 341-355.
2. Garey, M. R. and Johnson, D. S., Computers and Intractability: A Guide to the Theory of script N sign ℘-Completeness. Freeman, New York, 1978.
3. Ingargiola, G. P. and Korsh, J. F., Reduction algorithms for zero-one single knapsack problems. Management Science , 1973, 20, 460-463.
4. Jacobsen, S., On marginal allocation in single constraint min-max problems. Management Science , 1971, 17, 780-783.
5. Kaplan, S., Application of programs with maximum objective functions to problems of optimal resource allocation. Operations Research, 1974, 22, 802-807.
6. Kuno, T., Konno, H. and Zemel, E., A linear-time algorithm for solving continuous maximin knapsack problems. Operations Research Letters, 1991, 10, 23-26.
7. Luss, H., Minimax resource allocation problems: optimization and parametric analysis. European Journal of Operational Research , 1992, 60, 76-86.
8. Martello, S. and Toth, P., Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York, 1990.
9. Porteus, E. L. and Yormark, J. S., More on min-max allocation. Management Science, 1972, 17, 502-507.
10. Tang, C. S., A max-min allocation problem: its solutions and applications. Operations Research , 1988, 36, 359-367.