Solving the Static Design Routing and Wavelength Assignment Problem

DOI10.1007/978-3-642-19486-3_4MaRDI QIDQ3085937zbMATH OpenOpenAlexFDO

Authors Helmut Simonis

Publication date 1 April 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19486-3_4

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Solving routing and wavelength assignment problem with maximum edge-disjoint paths
• Lagrangean decomposition/relaxation for the routing and wavelength assignment problem
• Solving the routing and wavelength assignment problem with conflict-driven ASP solvers
• Routing and wavelength assignment by partition colouring
• Dynamic routing and wavelength assignment for multi-lightpath demands
• Near optimal design of wavelength routed optical networks

Cited in

(7)

• Integer programming models for the routing and spectrum allocation problem
• A network model for routing-fault-free wavelength selection in WRONoCs design
• Variable neighborhood descent with iterated local search for routing and wavelength assignment
• Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
• Near optimal design of wavelength routed optical networks
• Solving the routing and wavelength assignment problem with conflict-driven ASP solvers
• Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem

Describes a project that uses

Uses Software

• COIN-OR
• MiniSat

This page was built for publication: Solving the Static Design Routing and Wavelength Assignment Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3085937)