A ring-mesh topology design problem for optical transport networks

DOI10.1007/s10732-007-9034-2zbMath1173.90325OpenAlexW2095288691MaRDI QIDQ1009188

Junghee Han, Youngho Lee, Young-Jin Kim

Publication date: 31 March 2009

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-007-9034-2

zbMATH Keywords

integer programmingcolumn generationtabu searchvalid inequalityoptical transport networkring-mesh topology

Mathematics Subject Classification ID

Quadratic programming (90C20) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Uses Software

• CPLEX
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• SONET/SDH ring assignment with capacity constraints
• A branch and cut algorithm for hub location problems with single assignment
• Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
• Improving Discrete Model Representations via Symmetry Considerations
• Wavelength Routing and Assignment in a Survivable WDM Mesh Network
• A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
• Efficient distributions of arms‐control inspection effort
• A stochastic integer programming approach to solving a synchronous optical network ring design problem

This page was built for publication: A ring-mesh topology design problem for optical transport networks