Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers

DOI10.3233/AIC-140619zbMath1373.68034OpenAlexW2163677506MaRDI QIDQ4589085

Teresa Alsinet, Cèsar Fernández, Carles Mateu, Ramón Béjar, Francesc Guitart

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

benchmarksoptical networksanswer set programmingRWAlogic program tightness

Mathematics Subject Classification ID

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

This page was built for publication: Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers