GRASP and path relinking for the max-min diversity problem
暂无分享,去创建一个
Micael Gallego | Mauricio G. C. Resende | Abraham Duarte | Rafael Martí | M. Resende | R. Martí | A. Duarte | M. Gallego
[1] Luiz Satoru Ochi,et al. Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem , 2004, WEA.
[2] Michael Kuby. Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems , 1988 .
[3] Mauricio G. C. Resende,et al. POWER TRANSMISSION NETWORK DESIGN BY A GREEDY RANDOMIZED ADAPTIVE PATH RELINKING APPROACH , 2022 .
[4] M. Kuby. Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems , 2010 .
[5] Mauricio G. C. Resende,et al. A Hybrid Heuristic for the p-Median Problem , 2004, J. Heuristics.
[6] Celso C. Ribeiro,et al. Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..
[7] Abraham Duarte,et al. Tabu search and GRASP for the maximum diversity problem , 2007, Eur. J. Oper. Res..
[8] Rafael Martí,et al. Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..
[9] F. Glover,et al. Heuristic algorithms for the maximum diversity problem , 1998 .
[10] Jeffery L. Kennington,et al. Interfaces in Computer Science and Operations Research , 1997 .
[11] Celso C. Ribeiro,et al. A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..
[12] Alistair I. Mees,et al. Convergence of an annealing algorithm , 1986, Math. Program..
[13] Fred W. Glover,et al. Principles of scatter search , 2006, Eur. J. Oper. Res..
[14] M. Resende. GRASP WITH EVOLUTIONARY PATH-RELINKING , 2007 .
[15] Mauricio G. C. Resende,et al. A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..
[16] F. Glover,et al. Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming* , 1993 .
[17] R. Chandrasekaran,et al. Location on Tree Networks: P-Centre and n-Dispersion Problems , 1981, Math. Oper. Res..
[18] Joffre Danilo Avendaño Carpio,et al. Desarrollo de una metodología para la preservación digital de la memoria institucional de la Escuela Politécnica del Ejército (ESPE) y su aplicación en el Departamento de Ciencias de la Computación , 2006 .
[19] E. Erkut. The discrete p-dispersion problem , 1990 .
[20] Celso C. Ribeiro,et al. Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.
[21] F. Glover,et al. Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.
[22] Rafael Martí,et al. GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..
[23] Rex K. Kincaid. Good solutions to discrete noxious location problems via metaheuristics , 1992, Ann. Oper. Res..
[24] Jay B. Ghosh,et al. Computational aspects of the maximum diversity problem , 1996, Oper. Res. Lett..
[25] S. Binato,et al. Power transmission network design by greedy randomized adaptive path relinking , 2005, IEEE Transactions on Power Systems.
[26] Fred Glover,et al. Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .
[27] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[28] M. Resende,et al. A probabilistic heuristic for a computationally difficult set covering problem , 1989 .