On column generation formulations for the RWA problem

DOI10.1016/j.dam.2008.08.033zbMath1162.90355MaRDI QIDQ1025995

Christophe Meyer, Babacar Thiongane, Brigitte Jaumard

Publication date: 23 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.08.033

zbMATH Keywords

column generation; optimal solution; network dimensioning; RWA problem; WDM network

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

90B20: Traffic problems in operations research

Related Items

Further contributions to network optimization, Dual-neighborhood iterated local search for routing and wavelength assignment, Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators, Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem, Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem, A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks, Near optimal design of wavelength routed optical networks, Variable neighborhood descent with iterated local search for routing and wavelength assignment, Lagrangean decomposition/relaxation for the routing and wavelength assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Branching in branch-and-price: A generic scheme
• Routing and wavelength assignment by partition colouring
• Geometric algorithms and combinatorial optimization.
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Wavelength Conversion in Optical Networks
• Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
• A Column Generation Approach for Graph Coloring
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm