An algorithm for the multidimensional multiple-choice knapsack problem

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E80-A, Issue 3, 1997, Pages 582-589

  Moser, Martin ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Knapsack problem; Lagrange multipliers; Real time configuration; Scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; OPTIMIZATION; SCHEDULING;

MULTIDIMENSIONAL MULTIPLE CHOICE KNAPSACK PROBLEM; REAL TIME CONFIGURATION;

ALGORITHMS;

EID: 0031097714     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. G.B. Dantzig, "Discrete variable extremum problems," Operations Research, vol.5, 1957.
2. D. Dudzinsky and S. Walukiewicz, "Exact methods for the knapsack problem and its generalizations," European Journal of Operational Research, vol.28, 1987.
3. M.E. Dyer, N. Kayal, and J. Walker, "A branch and bound algorithm for solving the multiple choice knapsack problem," Journal of Computational and Applied Mathematics, vol.11, 1984.
4. H. Everett, III, "Generalized Lagrange multiplier method for solving problems of optimum allocation of resources," Operations Research, vol.2, 1963.
5. J. Lorie and L.J. Savage, "Three problems in capital rationing," Journal of Business, Oct. 1955.
6. M.J. Magazine and O. Oguz, "A heuristic algorithm for the multidimensional zero-one knapsack problem," European Journal of Operation Research, vol.16, no.3, June 1984.
7. S. Martello and P. Toth, "Knapsack Problems: Algorithms and Computer Implementations," Wiley, Chichester, England, 1990.
8. M. Moser, "Declarative scheduling for optimally graceful QoS degradation," Proc. IEEE Multimedia Systems, Hiroshima, Japan, June 1996.
9. M.R. Nauss, "The 0-1 knapsack problem with multiple choice constraint," European Journal of Operational Research, vol.2, 1978.
10. G.L. Nemhauser and L.A. Wolsey, "Integer and Combinatorial Optimization," Wiley Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, NewYork, 1988.
11. G.L. Nemhauser and Z. Ullman, "Discrete dynamic programming and capital allocation," Management Science, vol.15, 1969.
12. S. Senju and Y. Toyoda, "An approach to linear programming with 0-1 variables," Management Science, vol.15, 1968.
13. H.M. Weingartner, "Mathematical Programming and the Analysis of Capital Budgeting Problems," Markham, Chicago, 1967.
14. H.M. Weingartner and D.N. Ness, "Methods for the solution of the multi-dimensional 0-1 knapsack problem," Operations Research, vol.15, no.l, 1967.