Variable neighborhood tabu search and its application to the median cycle problem
暂无分享,去创建一个
Inmaculada Rodríguez Martín | José A. Moreno-Pérez | J. Marcos Moreno-Vega | J. M. Moreno-Vega | J. Moreno-Pérez
[1] A B Lovins,et al. University budget cuts. , 1983, Science.
[2] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[3] Pierre Hansen,et al. Variable Neighborhood Decomposition Search , 1998, J. Heuristics.
[4] Michel Gendreau,et al. The Covering Tour Problem , 1997, Oper. Res..
[5] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[6] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[7] Charles ReVelle,et al. SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPER.: THE SHORTEST COVERING PATH PROBLEM: AN APPLICATION OF LOCATIONAL CONSTRAINTS TO NETWORK DESIGN , 1984 .
[8] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[9] Vicki Aaronson Hutson,et al. Maximal Direct Covering Tree Problems , 1989, Transp. Sci..
[10] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[11] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.