The ring/-rings network design problem: model and branch-and-cut algorithm
From MaRDI portal
Publication:4642409
Recommendations
- Topological design of a two-level network with ring-star configuration
- Polyhedral results for two-connected networks with bounded rings
- A branch-and-cut algorithm for two-level survivable network design problems
- An integer linear programming formulation and branch-and-cut algorithm for the capacitated \(m\)-ring-star problem
- scientific article; zbMATH DE number 432987
Cited in
(12)- Facility location with tree topology and radial distance constraints
- Topological design of ring networks
- Models for a Steiner multi-ring network design problem with revenues
- The non-disjoint \(m\)-ring-star problem: polyhedral results and SDH/SONET network design
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
- A multi-commodity flow based model for multi layer hierarchical ring network design
- Models for a Steiner ring network design problem with revenues
- A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours
- A branch-and-cut algorithm for two-level survivable network design problems
- scientific article; zbMATH DE number 1086983 (Why is no real title available?)
- Perspectives on modeling hub location problems
- Modeling and solving the two-level generalized median tour problem
This page was built for publication: The ring/\(\kappa\)-rings network design problem: model and branch-and-cut algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642409)