Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem.

Marcelo Bianchetti Javier Marenco

Published in: LAGOS (2021)

Keyphrases

linear programming
computational complexity
worst case
optimal solution
search space
mathematical model
combinatorial optimization
randomly generated
routing problem
learning algorithm
objective function
cost function
np hard
dynamic programming
expectation maximization
linear programming relaxation