Solving the routing and wavelength assignment problem with conflict-driven ASP solvers

DOI10.3233/AIC-140619MaRDI QIDQ4589085zbMATH OpenOpenAlexFDO

Authors Teresa Alsinet, Ramon Bejar, Cesar Fernandez, Francesc Guitart, Carles Mateu

Publication date 7 November 2017

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-140619

zbMATH Keywords

answer set programmingbenchmarksRWAoptical networkslogic program tightness

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Logic programming (68N17) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• Solving routing and wavelength assignment problem with maximum edge-disjoint paths
• A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands
• Solving the Static Design Routing and Wavelength Assignment Problem
• Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
• Routing and wavelength assignment in optical networks using bin packing based algorithms

Cited in

(1)

• Solving the Static Design Routing and Wavelength Assignment Problem

This page was built for publication: Solving the routing and wavelength assignment problem with conflict-driven ASP solvers

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