A GRASP-based approach to the generalized minimum spanning tree problem
暂无分享,去创建一个
Luiz Satoru Ochi | Víctor Parada | Eduardo Uchoa | Cristiane S. Ferreira | Eduardo Uchoa | L. Ochi | V. Parada | Cristiane Ferreira
[1] Matthijs den Besten,et al. Design of Iterated Local Search Algorithms , 2001, EvoWorkshops.
[2] El-Ghazali Talbi,et al. Metaheuristics - From Design to Implementation , 2009 .
[3] S. Raghavan,et al. The prize-collecting generalized minimum spanning tree problem , 2008, J. Heuristics.
[4] Gilbert Laporte,et al. On generalized minimum spanning trees , 2001, Eur. J. Oper. Res..
[5] F. Glover,et al. Fundamentals of Scatter Search and Path Relinking , 2000 .
[6] Andrea Lodi,et al. Strengthening Chvátal-Gomory cuts and Gomory fractional cuts , 2002, Oper. Res. Lett..
[7] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[8] Salvatore Torquato,et al. Globally and locally minimal weight spanning tree networks , 2001 .
[9] Bertrand M. T. Lin,et al. Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem , 2003, J. Exp. Theor. Artif. Intell..
[10] Matteo Fischetti,et al. The symmetric generalized traveling salesman polytope , 1995, Networks.
[11] Gilbert Laporte,et al. A comparative analysis of several formulations for the generalized minimum spanning tree problem , 2002, Networks.
[12] M. Dorigo,et al. Design of Iterated Local Search Algorithms An Example Application to the Single Machine Total Weighted Tardiness Problem , 2001 .
[13] Edmund Ihler,et al. Class Steiner Trees and VLSI-design , 1999, Discret. Appl. Math..
[14] Temel Öncan,et al. A tabu search heuristic for the generalized minimum spanning tree problem , 2008, Eur. J. Oper. Res..
[15] Celso C. Ribeiro,et al. Probability Distribution of Solution Time in GRASP: An Experimental Investigation , 2002, J. Heuristics.
[16] Eduardo Uchoa,et al. Reduction tests for the prize-collecting Steiner problem , 2006, Oper. Res. Lett..
[17] P. C. POP. A survey of different integer programming formulations of the generalized minimum spanning tree problem , 2009 .
[18] Celso C. Ribeiro,et al. GRASP with Path-Relinking: Recent Advances and Applications , 2005 .
[19] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[20] Gilbert Laporte,et al. The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm , 2004, Networks.
[21] Stefan Voß,et al. Solving group Steiner problems as Steiner problems , 2004, Eur. J. Oper. Res..
[22] Moshe Dror,et al. Generalized spanning trees , 2000, Eur. J. Oper. Res..
[23] Young-Soo Myung,et al. On the generalized minimum spanning tree problem , 1995, Networks.
[24] Corinne Feremans. Generalized Spanning Trees and Extensions , 2001 .
[25] James B. Orlin,et al. A Faster Algorithm for Finding the Minimum Cut in a Directed Graph , 1994, J. Algorithms.
[26] Mohamed Haouari,et al. Upper and lower bounding strategies for the generalized minimum spanning tree problem , 2006, Eur. J. Oper. Res..
[27] S. Raghavan,et al. Heuristic Search for the Generalized Minimum Spanning Tree Problem , 2005, INFORMS J. Comput..