A new heuristic for solving the multichoice multidimensional knapsack problem

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 35, Issue 5, 2005, Pages 708-717

  Parra Hernández, Rafael ^a   Dimopoulos, Nikitas J ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Heuristics; Multichoice multidimensional knapsack problem (MMKP)

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; ITERATIVE METHODS; LINEAR PROGRAMMING;

COEFFICIENT VALUES; MULTICHOICE MULTIDIMENSIONAL KNAPSACK PROBLEM; OBJECTIVE FUNCTION; PSEUDO-UTILITY VALUES;

OPERATIONS RESEARCH;

EID: 27144506276     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2005.851140     Document Type: Article

References (32)

1. M. Moser, "Declarative scheduling for optimally graceful QoS degradation," in Proc. IEEE Int. Conf. Multimedia Computing Systems (ICMCS), 1996, pp. 86-93.
2. L. Chen, "The utility model applied to layer-coded sources," Master's thesis, Dept. of Computer Science, University of Victoria, Victoria, BC, Canada, 1998.
3. M. Shahadatullah-Khan, "Quality adaptation in a multisession multimedia system: Model, algorithms and architecture," Ph.D. dissertation, Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada, 1998.
4. R. Watson, "The optimal admission and adaptation of service level agreements in packet networks: Applying the utility model," Master's thesis, Dept. of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada, 2001.
5. C. Lee, J. Lehoczky, D. Siewiorek, R. Rajkumar, and J. Hansen, "A scalable solution to the multi-resource QoS problem," in Proc. IEEE Real-Time Systems Symp., Dec. 1999, pp. 315-326.
6. C. Lee, J. Lehoezky, R. Rajkumar, and D. Siewiorek, "On quality of service optimization with discrete QoS options," in Proc. IEEE RealTime Technology Applications Symp., Jun. 1999, pp. 276-286.
7. R. Parra-Hernandez and N. J. Dimopoulos, "Channel resource allocation/reallocation in cellular communication and linear programming," in Proc. IEEE Int. Conf. Systems, Man Cybernetics, Oct. 2003, pp. 2983-2989.
8. D. Warner and J. Prawda, "A mathematical programming model for scheduling nursing personnel in a hospital," Manage. Sci. (Application Series Part 1), vol. 19, pp. 411-422, Dec. 1972.
9. M. Garey and D. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
10. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations. New York: Wiley, 1990.
11. G. Dantzig, "Discrete-variable extremum problems," Oper Res., vol. 5, pp. 266-277, 1957.
12. E. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
13. S. Sahni, "Approximate algorithms for the 0-1 knapsack problem," J. ACM, vol. 22, pp. 115-124, 1975.
14. O. Ibarra and C. Kim, "Fast approximation algorithms for the knapsack and sum of subset problems," J. ACM, vol. 22, pp. 463-468, 1975.
15. M. M. Garey and D. Johnson, "Complexity results for multiprocessor scheduling under resource constraints," SIAM J. Comput., vol. 4, pp. 397-411, 1975.
16. D. Pisinger, "Algorithms for knapsack problems," Ph.D. dissertation, Department of Computer Science, University of Copenhagen, Copenhagen, Denmark, 1995.
17. M. Moser, D. Jokanović, and N. Shiratori, "An algorithm for the multidimensional multiple-choice knapsack problem," IEICE Trans. Fundamentals, vol. E80-A, pp. 582-589, Mar. 1997.
18. H. Pirkul, "A heuristic solution procedure for the multiconstraint zero-one knapsack problem," Nav. Res. Logist., vol. 34, pp. 161-172, 1987.
19. P. Khan, K. Li, E. Manning, and M. Akbar, "Solving the knapsack problem for adaptive multimedia system," Studia Informatica, vol. 202.
20. E. Balas and C. Martin, "Pivot and complement-A heuristic for 0-1 programming," Manage. Sci., vol. 26, pp. 86-96, Jan. 1980.
21. B. Gavish and H. Pirkul, "Efficient algorithm for solving the multiconstraint zero-one knapsack problem to optimality," Math. Programming, vol. 31, pp. 78-105, 1985.
22. P. Chu and J. Beasley, "A genetic algorithm for the multidimensional knapsack problem," J. Heuristics, vol. 4, pp. 63-86, Jun. 1998.
23. R. Loulou and E. Michaelides, "New greedy-like heuristics for the multidimensional 10-1 knapsack problem," Oper Res., vol. 27, pp. 1101-1114, Nov. 1979.
24. M. Magazine and O. Oguz, "A heuristic algorithm for the multidimensional zero-one knapsack problem," Eur. J. Oper. Res., vol. 16, pp. 319-326, Jun. 1984.
25. Y. Toyoda, "A simplified algorithm for obtaining approximate solution to zero-one programming problems," Manage. Sci., vol. 21, pp. 1417-1427, Aug. 1975.
26. J. Ji and Y. Ye, "A complexity analysis for interior-point algorithms based on Karmarkar's potential function," SIAM J. Optim., vol. 4, pp. 512-520, Aug. 1994.
27. Y. Ye, Interior Point Algorithms: Theory and Analysis (Series in Discrete Mathematics and Optimization). New York: Wiley-Interscience, 1997.
28. H. Everet, "Generalized lagrange multiplier method for solving problems of optimum allocation of resources," Oper Res., vol. 11, pp. 399-417, May 1963.
29. J. Czyzyk, S. Mehrotra, M. Wagner, and S. Wright, "PCx user guide (Version 1.1)," Optimization Technology Center, Tech. Rep. OTC, 1997.
30. Y. Zhang, "Solving large-scale linear programming by interior-point methods under the MATLAB environment," University of Maryland Baltimore County, Tech. Rep. TR96-01, 1996.
31. I. Lustig, R. Marsten, and D. Shanno, "On implementing Mehrotra's predictor-corrector interior-point method for linear programming," SIAM J. Optim., vol. 2, pp. 435-449, Aug. 1992.
32. R. Parra-Hernandez and N. Dimopoulos, "Quantitative performance comparison of the MOSER, HEU and HMMKP heuristics for solving the MMKP," Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada, Tech. Rep. ECE-0401, 2004.