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

Marcelo Bianchetti Javier Marenco

Published in: CoRR (2021)

Keyphrases

np hard
optimal solution
routing problem
dynamic programming
worst case
convex hull
linear programming
learning algorithm
cost function
computational complexity
mixed integer
probabilistic model
multi objective
search space
integer programming
lower and upper bounds
mixed integer programming
valid inequalities