[1]AKBARA M M, RAHMANB M S, KAYKOBADB M,et al. Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls[J].Computers and Operations Research, 2006,33(5):1259-1273.
[2]CHERFI N, HIFI M. A column generation method for the multiple-choice multi-dimensional knapsack problem [J].Computational Optimization and Applications, 2010, 46(1): 51-73.
[3]BALAS E, ZEMEL E. An algorithm for large zero-one knapsack problems [J].International Journal of Operational Research, 1980,28(5): 1130-1154.
[4]PISINGER D. An expanding-core algorithm for the exact 0-1 knapsack problem [J].European Journal of Operational Research, 1995, 87(1): 175-187.
[5]PUCHINGER J, RAIDL G R, PFERSCHY U. The core concept for the multidimensional knapsack problem [C]// European Conference on Evolutionary Computation in Combinatorial Optimisation, LNCS 3906. Berlin: Springer-Verlag, 2006: 195-208.
[6]SINHA P, ZOLTNERS A A. The multiple-choice knapsack problem [J].International Journal of Operations Research,1979,27(3):503-515.
[7]PARRA-HERNANDEZ R, DIMOPOULOS N J. A new heuristic for solving the multichoice multidimensional knapsack problem [J].IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, 2005,35(5):708-717.
[8]PISINGER D. A minimal algorithm for the multiple-choice knapsack problem [J].European Journal of Operational Research,1995, 83(2):394-410.
[9]SBIHI A. A best first search exact algorithm for the multiple-choice multidimensional knapsack problem [J].Journal of Combinatorial Optimization,2007,13(4):337-351.
[10]CUI ZHIHUA, CAI XINGJUAN, ZENG JIANCHAO. Chaotic performance-dependent particle swarm optimization [J].International Journal of Innovative Computing, Information and Control, 2009, 5(4):951-960. |