A branch-and-cut algorithm for the routing and spectrum allocation problem.
Marcelo BianchettiJavier MarencoPublished in: Discret. Appl. Math. (2023)
Keyphrases
- learning algorithm
- preprocessing
- computational complexity
- single pass
- optimal solution
- times faster
- optimization algorithm
- theoretical analysis
- experimental evaluation
- genetic algorithm
- recognition algorithm
- computational cost
- high accuracy
- computationally efficient
- dynamic programming
- segmentation algorithm
- np hard
- improved algorithm
- classification algorithm
- convergence rate
- neural network
- estimation algorithm
- k means
- significant improvement
- path planning
- tree structure
- expectation maximization
- particle swarm optimization