The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm.
Ibrahima DiarrassoubaYoussouf HadhbiPublished in: ISCO (2022)
Keyphrases
- computational complexity
- np hard
- dynamic programming
- optimal solution
- cost function
- expectation maximization
- probabilistic model
- learning algorithm
- routing problem
- worst case
- network design problem
- minimal cost
- network flow
- primal dual
- randomly generated
- routing algorithm
- convergence rate
- shortest path
- supply chain
- search space
- objective function