Iterated responsive threshold search for the quadratic multiple knapsack problem
暂无分享,去创建一个
[1] Francisco J. Rodríguez,et al. Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem , 2014, Eur. J. Oper. Res..
[2] Paolo Toth,et al. Exact Solution of the Quadratic Knapsack Problem , 1999, INFORMS J. Comput..
[3] Deeparnab Chakrabarty,et al. Knapsack Problems , 2008 .
[4] Alain Billionnet,et al. An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem , 2004, Eur. J. Oper. Res..
[5] David Pisinger. An exact algorithm for large multiple knapsack problems , 1999, Eur. J. Oper. Res..
[6] Sang-Wook Lee,et al. A memetic algorithm for the quadratic multiple container packing problem , 2010, Applied Intelligence.
[7] Fred W. Glover,et al. Tabu Thresholding: Improved Search by Nonmonotonic Trajectories , 1995, INFORMS J. Comput..
[8] F. Glover,et al. Neighborhood Combination for Unconstrained Binary Quadratic Problems , 2009 .
[9] Bryant A. Julstrom,et al. The quadratic multiple knapsack problem and three heuristic approaches to it , 2006, GECCO.
[10] Gerhard W. Dueck,et al. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .
[11] Fred W. Glover,et al. Strategic oscillation for the quadratic multiple knapsack problem , 2014, Comput. Optim. Appl..
[12] P. Hammer,et al. Quadratic knapsack problems , 1980 .
[13] Alok Singh,et al. A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem , 2007, EvoCOP.
[14] Fred W. Glover,et al. A computational study on the quadratic knapsack problem with multiple constraints , 2012, Comput. Oper. Res..
[15] Zhipeng Lü. Neighborhood Combination for Unconstrained Binary Quadratic Programming , 2009 .
[16] S. Martello,et al. Heuristische Algorithmen zur Packung von mehreren Rucksäcken , 1981 .
[17] Fred W. Glover,et al. Neighborhood analysis: a case study on curriculum-based course timetabling , 2011, J. Heuristics.
[18] G. Dueck. New optimization heuristics , 1993 .
[19] F. Glover,et al. A heuristic programming approach to the employee scheduling problem and some thoughts on “managerial robots” , 1984 .
[20] Alok Singh,et al. A Swarm Intelligence Approach to the Quadratic Multiple Knapsack Problem , 2010, ICONIP.
[21] Luca Di Gaspero,et al. Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems , 2006, J. Math. Model. Algorithms.
[22] Tugba Saraç,et al. A Genetic Algorithm for the Quadratic Multiple Knapsack Problem , 2007, BVAI.
[23] David Pisinger,et al. The quadratic knapsack problem - a survey , 2007, Discret. Appl. Math..
[24] John C. Fisk,et al. An algorithm for 0‐1 multiple‐knapsack problems , 1978 .
[25] Paolo Toth,et al. Heuristic algorithms for the multiple knapsack problem , 1981, Computing.
[26] Gregory W. Corder,et al. Nonparametric Statistics for Non-Statisticians: A Step-by-Step Approach , 2009 .