Modified Choice Function Heuristic Selection for the Multidimensional Knapsack Problem
暂无分享,去创建一个
[1] Vincenzo Cutello,et al. Parallel Problem Solving from Nature - PPSN XII , 2012, Lecture Notes in Computer Science.
[2] E. Burke,et al. A Late Acceptance Strategy in Hill-Climbing for Exam Timetabling Problems , 2008 .
[3] Edmund K. Burke,et al. Practice and Theory of Automated Timetabling III , 2001, Lecture Notes in Computer Science.
[4] A. Sima Etaner-Uyar,et al. Selection hyper-heuristics in dynamic environments , 2013, J. Oper. Res. Soc..
[5] Graham Kendall,et al. A Classification of Hyper-heuristic Approaches , 2010 .
[6] Graham Kendall,et al. A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.
[7] Hasan Pirkul,et al. A heuristic solution procedure for the multiconstraint zero‐one knapsack problem , 1987 .
[8] Ender Özcan,et al. Late acceptance-based selection hyper-heuristics for cross-domain heuristic search , 2013, 2013 13th UK Workshop on Computational Intelligence (UKCI).
[9] Ender Özcan,et al. A comprehensive analysis of hyper-heuristics , 2008, Intell. Data Anal..
[10] H. Martin Weingartner,et al. Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem , 2015 .
[11] Graham Kendall,et al. A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.
[12] Edmund K. Burke,et al. An Improved Choice Function Heuristic Selection for Cross Domain Heuristic Search , 2012, PPSN.
[13] Hugo Terashima-Marín,et al. A hyper-heuristic for solving one and two-dimensional bin packing problems , 2011, GECCO '11.
[14] Hans Kellerer,et al. Multiple Knapsack Problems , 2004 .
[15] Luca Di Gaspero,et al. A Reinforcement Learning approach for the Cross-Domain Heuristic Search Challenge , 2011 .
[16] Graham Kendall,et al. Scheduling English Football Fixtures over the Holiday Period Using Hyper-heuristics , 2010, PPSN.
[17] Edmund K. Burke,et al. Practice and Theory of Automated Timetabling VI, 6th International Conference, PATAT 2006, Brno, Czech Republic, August 30 - September 1, 2006, Revised Selected Papers , 2007, PATAT.
[18] H. Martin Weingartner,et al. Methods for the Solution of the Multidimensional 0/1 Knapsack Problem , 1967, Operational Research.
[19] Michel Gendreau,et al. Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..
[20] Ender Özcan,et al. A case study of memetic algorithms for constraint optimization , 2009, Soft Comput..
[21] Osman Oguz,et al. A heuristic algorithm for the multidimensional zero-one knapsack problem , 1984 .
[22] Ender Özcan,et al. A genetic programming hyper-heuristic for the multidimensional knapsack problem , 2014, Kybernetes.
[23] Ender Özcan,et al. An Experimental Study on Hyper-heuristics and Exam Timetabling , 2006, PATAT.
[24] Arnaud Fréville,et al. An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem , 1994, Discret. Appl. Math..
[25] Edmund K. Burke,et al. Controlling Crossover in a Selection Hyper-heuristic Framework , 2011 .
[26] Graham Kendall,et al. Monte Carlo hyper-heuristics for examination timetabling , 2012, Ann. Oper. Res..
[27] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.
[28] Susan H. Xu,et al. Greedy algorithm for the general multidimensional knapsack problem , 2007, Ann. Oper. Res..
[29] Ender Özcan,et al. Generation of VNS Components with Grammatical Evolution for Vehicle Routing , 2013, EuroGP.
[30] Edmund K. Burke,et al. Examination timetabling using late acceptance hyper-heuristics , 2009, 2009 IEEE Congress on Evolutionary Computation.
[31] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[32] A Volgenant,et al. An Improved Heuristic for Multidimensional 0-1 Knapsack Problems , 1990 .