A primal heuristic for the routing and spectrum assignment problem
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.
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Objeto de conferencia Resumen |
| Lenguaje: | Inglés |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/141644 http://50jaiio.sadio.org.ar/pdfs/siiio/SIIIO-04.pdf |
| Aporte de: |
| Sumario: | 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. |
|---|