Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem
暂无分享,去创建一个
[1] M. Moser,et al. An Algorithm for the Multidimensional Multiple-Choice Knapsack Problem , 1997 .
[2] Marco Dorigo,et al. Distributed Optimization by Ant Colonies , 1992 .
[3] Chaitr S. Hiremath. New heuristic and metaheuristic approaches applied to the multiple -choice multidimensional knapsack problem , 2008 .
[4] Mohammad Sohel Rahman,et al. A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem , 2007, The Journal of Supercomputing.
[5] Eric G. Manning,et al. Heuristic Solutions for the Multiple-Choice Multi-dimension Knapsack Problem , 2001, International Conference on Computational Science.
[6] Mohammad Sohel Rahman,et al. Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls , 2006, Comput. Oper. Res..
[7] Marshall L. Fisher,et al. The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..
[8] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[9] Hoong Chuin Lau,et al. Multi-Period Multi-Dimensional Knapsack Problem and Its Application to Available-to-Promise , 2004 .
[10] Eric G. Manning,et al. Quality adaptation in a multisession multimedia system: model, algorithms, and architecture , 1998 .
[11] Kin F. Li,et al. Solving the Knapsack Problem for Adaptive Multimedia Systems , 2002, Stud. Inform. Univ..
[12] Marco Dorigo,et al. The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[13] Christine Solnon,et al. An Ant Colony Optimization Meta-Heuristic for Subset Selection Problems , 2006 .
[14] Nikitas J. Dimopoulos,et al. A new heuristic for solving the multichoice multidimensional knapsack problem , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.
[15] Wang Chen,et al. An efficient hybrid algorithm for resource-constrained project scheduling , 2010, Inf. Sci..
[16] Y. Toyoda. A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems , 1975 .
[17] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.
[18] Mhand Hifi,et al. Heuristic algorithms for the multiple-choice multidimensional knapsack problem , 2004, J. Oper. Res. Soc..
[19] Zuren Feng,et al. An ant colony optimization approach for the multidimensional knapsack problem , 2010, J. Heuristics.
[20] Mhand Hifi,et al. A column generation method for the multiple-choice multi-dimensional knapsack problem , 2010, Comput. Optim. Appl..
[21] Thomas Stützle,et al. Ant Colony Optimization , 2009, EMO.
[22] Abdelkader Sbihi,et al. A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem , 2007, J. Comb. Optim..
[23] Thomas Stützle,et al. MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..
[24] David Pisinger. A minimal algorithm for the Multiple-choice Knapsack Problem , 1995 .
[25] Mhand Hifi,et al. A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem , 2006, Comput. Optim. Appl..
[26] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.