论文信息 - A GRASP/VND Heuristic for a Generalized Ring Star Problem

A GRASP/VND Heuristic for a Generalized Ring Star Problem

A generalization of the Ring Star Problem, called Two-Node-connected Star Problem (2NCSP), is here addressed. We are given an undirected graph, pendant-costs and core-costs. The goal is to find the minimum-cost spanning graph, where the core is a two-node-connected component, and the remaining nodes are pendant to this component.

Pablo Romero | Franco Robledo | Omar Viera | Rodrigo Recoba

[1] Lucídio dos Anjos Formiga Cabral,et al. An Efficient Heuristic for the Ring Star Problem , 2006, WEA.

[2] Cid C. de Souza,et al. The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm , 2011, Discret. Appl. Math..

[3] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[4] Franco Robledo Amoza. GRASP heuristics for Wide Area Network design , 2005 .

[5] Inmaculada Rodríguez Martín,et al. The Ring Star Problem: Polyhedral analysis and exact algorithm , 2004, Networks.

[6] Clyde L. Monma,et al. Minimum-weight two-connected spanning networks , 1990, Math. Program..

[7] Panos M. Pardalos,et al. Randomized heuristics for the Max-Cut problem , 2002, Optim. Methods Softw..

[8] Herminia I. Calvete,et al. An efficient evolutionary algorithm for the ring star problem , 2013, Eur. J. Oper. Res..

[9] Inmaculada Rodríguez Martín,et al. Variable neighborhood tabu search and its application to the median cycle problem , 2003, Eur. J. Oper. Res..

[10] M. Resende,et al. GRASP: Greedy Randomized Adaptive Search Procedures , 2003 .