A two-level metaheuristic for the all colors shortest path problem
暂无分享,去创建一个
Raffaele Cerulli | Francesco Carrabs | Andrea Raiconi | Rosa Pentangelo | R. Cerulli | F. Carrabs | A. Raiconi | R. Pentangelo
[1] Gilbert Laporte,et al. The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm , 2004, Networks.
[2] Gilbert Laporte,et al. Generalized travelling salesman problem through n sets of nodes: the asymmetrical case , 1987, Discret. Appl. Math..
[3] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[4] Matteo Fischetti,et al. A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..
[5] Markus Leitner,et al. Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem , 2008, J. Heuristics.
[6] Federica Laureana,et al. On the Forward Shortest Path Tour Problem , 2017 .
[7] Matteo Fischetti,et al. The symmetric generalized traveling salesman polytope , 1995, Networks.
[8] S. Raghavan,et al. Heuristic Search for the Generalized Minimum Spanning Tree Problem , 2005, INFORMS J. Comput..
[9] Lawrence V. Snyder,et al. A random-key genetic algorithm for the generalized traveling salesman problem , 2006, Eur. J. Oper. Res..
[10] Zoran Saric,et al. An Efficient Transformation of the Generalized Traveling Salesman Problem into the Traveling Salesman Problem on Digraphs , 1997, Inf. Sci..
[11] Young-Soo Myung,et al. On the generalized minimum spanning tree problem , 1995, Networks.
[12] Demetrio Laganà,et al. Solving the shortest path tour problem , 2013, Eur. J. Oper. Res..
[13] Petrica C. Pop,et al. A new relaxation method for the generalized minimum spanning tree problem , 2006, Eur. J. Oper. Res..
[14] Gilbert Laporte,et al. A comparative analysis of several formulations for the generalized minimum spanning tree problem , 2002, Networks.
[15] Moshe Dror,et al. Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm , 2005, J. Oper. Res. Soc..
[16] Christian Artigues,et al. A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem , 2008, Comput. Oper. Res..
[17] Hüseyin Akcan,et al. All Colors Shortest Path Problem , 2015, ArXiv.
[18] Temel Öncan,et al. A tabu search heuristic for the generalized minimum spanning tree problem , 2008, Eur. J. Oper. Res..
[19] Moshe Dror,et al. Generalized spanning trees , 2000, Eur. J. Oper. Res..
[20] Yanchun Liang,et al. Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..
[21] Edmund Ihler,et al. Class Steiner Trees and VLSI-design , 1999, Discret. Appl. Math..
[22] Cem Evrendilek,et al. Complexity of Energy Efficient Localization With the Aid of a Mobile Beacon , 2018, IEEE Communications Letters.
[23] Hüseyin Akcan,et al. All Colors Shortest Path problem on trees , 2018, J. Heuristics.