Reducing the Experiments Required to Assess the Performance of Metaheuristic Algorithms Reducción de los Experimentos Requeridos para Evaluar el Desempeño de Algoritmos Metaheurísticos
暂无分享,去创建一个
V. GracielaMoraGuadalupeCastilla | Rodolfo A. Pazos Rangel | H. HéctorJ.Fraire | Juan Javier González Barbosa | José Antonio Martínez Flores | Laura Cruz Reyes | J. J. G. Barbosa | Guadalupe Castilla Valdez | L. C. Reyes | Héctor Joaquín | Fraire Huacuja | R. Abraham | Pazos Rangel
[1] Christian Blum,et al. Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] David Romero,et al. The optimal geometry of Lennard-Jones clusters: 148-309 , 1999 .
[4] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[5] Karla Espriella Fernandez. OPTIMIZACION MEDIANTE ALGORITMOS GENETICOS: APLICACION A LA LAMINACION EN CALIENTE , 2009 .
[6] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[7] P. Pardalos,et al. Handbook of global optimization , 1995 .
[8] F. Glover,et al. In Modern Heuristic Techniques for Combinatorial Problems , 1993 .
[9] Catherine C. McGeoch. Analyzing algorithms by simulation: variance reduction techniques and simulation speedups , 1992, CSUR.
[10] Catherine C. McGeoch. Experimental analysis of algorithms , 1986 .
[11] James R. Wilson. Variance Reduction Techniques for Digital Simulation , 1984 .
[12] David S. Johnson,et al. A theoretician's guide to the experimental analysis of algorithms , 1999, Data Structures, Near Neighbor Searches, and Methodology.