A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach
From MaRDI portal
Publication:1370717
DOI10.1016/S0305-0548(96)00081-0zbMath0891.90069MaRDI QIDQ1370717
Publication date: 26 October 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18)
Related Items
Hierarchical survivable network design problems, A branch-and-cut algorithm for two-level survivable network design problems, A design of self-healing ATM networks based on backup virtual paths., Survivability in Hierarchical Telecommunications Networks Under Dual Homing, Survivable and delay-guaranteed backbone wireless mesh network design
Cites Work
- Unnamed Item
- Balancing loads on Sonet rings with integer demand splitting
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- A multi-period design model for survivable network architecture selection for SONET interoffice networks
- An algorithm for designing rings for survivable fiber networks
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Tabu Search—Part I
- Tabu Search—Part II
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Depth-First Search and Linear Graph Algorithms