Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem.
Ibrahima DiarrassoubaYoussouf HadhbiAli Ridha MahjoubPublished in: J. Comb. Optim. (2024)
Keyphrases
- np hard
- computational complexity
- dynamic programming
- learning algorithm
- theoretical analysis
- improved algorithm
- objective function
- times faster
- detection algorithm
- cost function
- high accuracy
- k means
- experimental evaluation
- worst case
- computationally efficient
- simulated annealing
- search space
- response time
- data sets
- segmentation algorithm
- multi objective
- recognition algorithm
- similarity measure
- constrained problems