A survivable variant of the ring star problem

DOI10.1002/net.22193MaRDI QIDQ6196876

Fabian Castaño, André Rossi, Sonia Toubaline, Unnamed Author

Publication date: 15 March 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

integer linear programmingnetwork designsurvivabilityBenders decompositionring star problembranch-and-Benders-cut

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
• An improved Benders decomposition applied to a multi-layer network design problem
• Partitioning procedures for solving mixed-variables programming problems
• A branch and cut algorithm for hub location problems with single assignment
• Algorithms for the metric ring star problem with fixed edge-cost ratio
• An efficient evolutionary algorithm for the ring star problem
• Formalizing the Edmonds-Karp Algorithm
• Survivability in hierarchical telecommunications networks
• Survivability in Hierarchical Telecommunications Networks Under Dual Homing
• Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
• An exact algorithm for solving the ring star problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Design of Survivable Networks: A survey
• A Method for Solving Traveling-Salesman Problems

This page was built for publication: A survivable variant of the ring star problem