On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques
暂无分享,去创建一个
Carlos Cotta | Antonio J. Fernández | José E. Gallardo | Antonio J. Fernández | C. Cotta | J. E. Gallardo
[1] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..
[2] E. Balas,et al. Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .
[3] Rainer Schrader,et al. ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES , 1981 .
[4] Keith Price,et al. Review of "The Handbook of Artificial Intelligence Vol. 1 by Avron Barr & Edward A. Feigenbaum", William Kaufmann, Inc. 1981 , 1982, SGAR.
[5] Pablo Moscato,et al. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .
[6] H. Penny Nii,et al. The Handbook of Artificial Intelligence , 1982 .
[7] Martin Middendorf. More on the Complexity of Common Superstring and Supersequence Problems , 1994, Theor. Comput. Sci..
[8] Cameron Bruce Fraser,et al. Subsequences and Supersequences of Strings , 1995 .
[9] Zbigniew Michalewicz,et al. Handbook of Evolutionary Computation , 1997 .
[10] Carlos Cotta,et al. A Hybrid Genetic Algorithm for the 0-1 Multiple Knapsack Problem , 1997, ICANNGA.
[11] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[12] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.
[13] Jürgen Branke,et al. Improved heuristics and a genetic algorithm for finding short supersequences , 1998 .
[14] Martin W. P. Savelsbergh,et al. A Computational Study of Search Strategies for Mixed Integer Programming , 1999, INFORMS J. Comput..
[15] Chuan Yi Tang,et al. Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices , 1998, J. Comb. Optim..
[16] Robert A. Bosch. Maximum density stable patterns in variants of Conway's game of Life , 2000, Oper. Res. Lett..
[17] Jin-Kao Hao,et al. A hybrid approach for the 0-1 multidimensional knapsack problem , 2001, IJCAI 2001.
[18] Pablo Moscato,et al. A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.
[19] Krzysztof Pietrzak,et al. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems , 2003, J. Comput. Syst. Sci..
[20] Sven Rahmann. The shortest common supersequence problem in a microarray production setting , 2003, ECCB.
[21] Michel Vasquez,et al. Improved results on the 0-1 multidimensional knapsack problem , 2005, Eur. J. Oper. Res..
[22] Günther R. Raidl,et al. Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem , 2005, Evolutionary Computation.
[23] Hisao Ishibuchi,et al. Comparison Between Lamarckian and Baldwinian Repair on Multiobjective 0/1 Knapsack Problems , 2005, EMO.
[24] Carlos Cotta,et al. A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem , 2005, IWANN.
[25] Carlos Cotta,et al. Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem , 2005, IWINAC.
[26] Günther R. Raidl,et al. Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.
[27] William E. Hart,et al. Recent Advances in Memetic Algorithms , 2008 .