Designing WDM optical networks using branch-and-price

DOI10.1007/s10852-013-9221-0zbMath1280.65056OpenAlexW2029140566MaRDI QIDQ387309

Daliborka Stanojević, S. Raghu Raghavan

Publication date: 20 December 2013

Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-013-9221-0

zbMATH Keywords

network flowsWDM optical networksbranch-and price algorithmmultilayer network designwavelength division multiplexing optical networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators, The design of transparent optical networks minimizing the impact of critical nodes, Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems

Cites Work

• Primal-dual approximation algorithms for integral flow and multicut in trees
• A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks
• An exact algorithm for IP column generation
• Dissemination of information in optical networks: From technology to algorithms. In cooperation with Ralf Klasing.
• Fault-Tolerant Virtual Path Layout in ATM Networks
• Branch and Price for WDM Optical Networks with No Bifurcation of Flow
• Traffic Grooming: Combinatorial Results and Practical Resolutions
• Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network
• Routing Through Virtual Paths in Layered Telecommunication Networks
• Column Generation
• Implementing Mixed Integer Column Generation