Lagrangean decomposition/relaxation for the routing and wavelength assignment problem

DOI10.1002/net.20437zbMath1241.90074OpenAlexW2100641445MaRDI QIDQ2892159

Babacar Thiongane

Publication date: 18 June 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20437

zbMATH Keywords

Lagrangean relaxationsubgradient methodknapsack problemshortest path problemLagrangean decompositionrouting and wavelength assignment problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Routing and wavelength assignment by partition colouring
• On column generation formulations for the RWA problem
• On the Computational Complexity of Combinatorial Problems
• Validation of subgradient optimization
• The complexity of path coloring and call scheduling

This page was built for publication: Lagrangean decomposition/relaxation for the routing and wavelength assignment problem