An effective two-level solution approach for the prize-collecting generalized minimum spanning tree problem by iterated local search

[1]  S. Raghavan,et al.  The prize-collecting generalized minimum spanning tree problem , 2008, J. Heuristics.

[2]  Petrica C. Pop.  On the prize-collecting generalized minimum spanning tree problem , 2007, Ann. Oper. Res..

[3]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[4]  Petrica C. Pop.  Relaxation methods for the generalized minimum spanning tree problem , 2002 .

[5]  Edmund Ihler,et al.  Class Steiner Trees and VLSI-design , 1999, Discret. Appl. Math..

[6]  Moshe Dror,et al.  Generalized spanning trees , 2000, Eur. J. Oper. Res..

[7]  P. C. POP.  A survey of different integer programming formulations of the generalized minimum spanning tree problem , 2009 .

[8]  F. Glover,et al.  Metaheuristics , 2016, Springer International Publishing.

[9]  Víctor Parada,et al.  A multi-operator genetic algorithm for the generalized minimum spanning tree problem , 2016, Expert Syst. Appl..

[10]  Petrica C. Pop,et al.  A new relaxation method for the generalized minimum spanning tree problem , 2006, Eur. J. Oper. Res..

[11]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[12]  Celso C. Ribeiro,et al.  A GRASP with path-relinking and restarts heuristic for the prize-collecting generalized minimum spanning tree problem , 2020, Int. Trans. Oper. Res..

[13]  Gilbert Laporte,et al.  The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm , 2004, Networks.

[14]  Luiz Satoru Ochi,et al.  A GRASP-based approach to the generalized minimum spanning tree problem , 2012, Expert Syst. Appl..

[15]  Geraldo Robson Mateus,et al.  Branch-and-cut algorithms for the -arborescence star problem , 2020, Int. Trans. Oper. Res..

[16]  J. Hyam Rubinstein,et al.  Solving the prize‐collecting Euclidean Steiner tree problem , 2020, International Transactions in Operational Research.

[17]  Markus Leitner,et al.  Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem , 2008, J. Heuristics.

[18]  Petrica C. Pop,et al.  A two-level solution approach for solving the generalized minimum spanning tree problem , 2018, Eur. J. Oper. Res..

[19]  Markus Leitner,et al.  Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem , 2016, Comput. Oper. Res..

[20]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[21]  Ronald L. Graham,et al.  On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[22]  Temel Öncan,et al.  A tabu search heuristic for the generalized minimum spanning tree problem , 2008, Eur. J. Oper. Res..

[23]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[24]  Young-Soo Myung,et al.  On the generalized minimum spanning tree problem , 1995, Networks.

[25]  Justo Puerto,et al.  Computational comparisons of different formulations for the Stackelberg minimum spanning tree game , 2021, Int. Trans. Oper. Res..

[26]  Petrică C. Pop,et al.  The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances , 2020, Eur. J. Oper. Res..

[27]  S. Raghavan,et al.  Heuristic Search for the Generalized Minimum Spanning Tree Problem , 2005, INFORMS J. Comput..