A survivable variant of the ring star problem
From MaRDI portal
Publication:6196876
Recommendations
- A branch-and-cut algorithm for two-level survivable network design problems
- An exact algorithm for solving the ring star problem
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Capacitated m two-node survivable star problem
Cites work
- scientific article; zbMATH DE number 1803762 (Why is no real title available?)
- scientific article; zbMATH DE number 758733 (Why is no real title available?)
- A branch and cut algorithm for hub location problems with single assignment
- A method for solving traveling-salesman problems
- Algorithms for the metric ring star problem with fixed edge-cost ratio
- An efficient evolutionary algorithm for the ring star problem
- An exact algorithm for solving the ring star problem
- An improved Benders decomposition applied to a multi-layer network design problem
- Design of Survivable Networks: A survey
- Formalizing the Edmonds-Karp algorithm
- Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations
- Optimizing a ring-based private line telecommunication network using tabu search
- Partitioning procedures for solving mixed-variables programming problems
- Survivability in hierarchical telecommunications networks
- Survivability in hierarchical telecommunications networks under dual homing
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
This page was built for publication: A survivable variant of the ring star problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196876)
