Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers.
Teresa AlsinetRamón BéjarCèsar FernándezFrancesc GuitartCarles MateuPublished in: AI Commun. (2015)
Keyphrases
- eigenvalue problems
- conflict resolution
- sat instances
- data driven
- np hard
- constraint problems
- combinatorial search
- sat solving
- antenna array
- routing protocol
- ad hoc networks
- satisfiability problem
- routing algorithm
- sat solvers
- routing problem
- solving problems
- network flow problem
- quantified boolean formulas
- web applications