论文信息 - A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability - 字舞流文

A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability

Pablo Romero | Franco Robledo | Omar Viera | Sebastián Laborde

[1] Héctor Cancela,et al. Topological optimization of reliable networks under dependent failures , 2015, Oper. Res. Lett..

[2] Hirofumi Suzuki,et al. Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams , 2020, WALCOM.

[3] Biswanath Mukherjee,et al. Data evacuation from data centers in disaster-affected regions through software-defined satellite networks , 2019, Comput. Networks.

[4] Robert Krauthgamer,et al. Hardness of Approximation for Vertex-Connectivity Network Design Problems , 2004, SIAM J. Comput..

[5] Alexander Shapiro,et al. The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[6] Appajosyula Satyanarayana,et al. A survey of some network reliability analysis and synthesis results , 2009, Networks.

[7] Christina Graves,et al. Classes of uniformly most reliable graphs for all-terminal reliability , 2019, Discret. Appl. Math..

[8] R. Ravi,et al. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..

[9] Gerardo Rubino,et al. A new simulation method based on the RVR principle for the rare event network reliability problem , 2012, Ann. Oper. Res..

[10] Gilbert Laporte,et al. The Steiner Traveling Salesman Problem and its extensions , 2019, Eur. J. Oper. Res..