A resilient variant of the ring star problem
From MaRDI portal
Cites work
- A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network
- A quadratic integer program for the location of interacting hub facilities
- A survivable variant of the ring star problem
- An efficient evolutionary algorithm for the ring star problem
- An exact algorithm for solving the ring star problem
- Design of Survivable Networks: A survey
- Formalizing the Edmonds-Karp algorithm
- scientific article; zbMATH DE number 1803765 (Why is no real title available?)
- scientific article; zbMATH DE number 758733 (Why is no real title available?)
- Network hub location problems: The state of the art
- Network resilience
- Solving the hub location problem in a star–star network
- Survivability in hierarchical telecommunications networks
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- The ring/-rings network design problem: model and branch-and-cut algorithm
- The tree of hubs location problem
- TSPLIB—A Traveling Salesman Problem Library
This page was built for publication: A resilient 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 Q6936271)