Ring network design

MaRDI QIDQ5294052zbMATH OpenFDO

Authors Mathias Henningsson, Kaj Holmberg, Di Yuan

Publication date 23 July 2007

zbMATH Keywords

column generationheuristicinteger programmingnetwork designrings

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A ring network design problem
• Design of survivable networks with bounded rings
• A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach
• Design of communication networks with survivability constraints
• Polyhedral approaches to the design of survivable networks

Cited in

(11)

• Design of partially survivable networks for cellular telecommunication systems
• A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach
• Designing tributary networks with multiple ring families.
• Exact algorithms for bi-objective ring tree problems with reliability measures
• Cost-effective designs of fault-tolerant access networks in communication systems
• Ring network design: An MCDM approach
• Broadcast ring sandwich networks
• A ring network design problem
• Design of survivable networks with bounded rings
• Design of survivable networks based on p-cycles
• Modeling and solving the two-level generalized median tour problem

This page was built for publication: Ring network design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5294052)