Iterated Tabu Search Algorithm for the Multidemand Multidimensional Knapsack Problem
暂无分享,去创建一个
[1] Francesco Maffioli,et al. Discrete facility location and routing of obnoxious activities , 2003, Discret. Appl. Math..
[2] Paola Cappanera,et al. A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem , 2001, INFORMS J. Comput..
[3] Lars Magnus Hvattum,et al. Adaptive memory search for multidemand multidimensional knapsack problems , 2006, Comput. Oper. Res..
[4] Dong Yue,et al. Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem , 2019, Eur. J. Oper. Res..
[5] Fred W. Glover,et al. Alternating control tree search for knapsack/covering problems , 2010, J. Heuristics.
[6] Eduardo Conde,et al. Semi-obnoxious location models: A global optimization approach , 1997 .
[7] Frank Plastria,et al. Static competitive facility location: An overview of optimisation approaches , 2001, Eur. J. Oper. Res..
[8] Mahesh C. Bhandari,et al. A note on the covering radius of optimum codes , 1991, Discret. Appl. Math..
[9] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.
[10] Francisco Gortázar,et al. Black box scatter search for general classes of binary optimization problems , 2010, Comput. Oper. Res..
[11] Samuel P. Marin,et al. Balancing and optimizing a portfolio of R&D projects , 2001 .