Objeto de conferencia
A primal heuristic for the routing and spectrum assignment problem
Autor
Bianchetti, Marcelo
Marenco, Javier
Institución
Resumen
In this work we propose a primal heuristic to improve the branch-and-cut algorithm presented in for one of the ILP formulations of the RSA problem proposed in, namely, the model DSL-BF. Sociedad Argentina de Informática e Investigación Operativa