A primal heuristic for the routing and spectrum assignment problem
- Autores
- Bianchetti, Marcelo; Marenco, Javier
- Año de publicación
- 2021
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- 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 - Materia
-
Ciencias Informáticas
Exgrid optical network
Routing and spectrum allocation
Integer programming - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/3.0/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/141644
Ver los metadatos del registro completo
id |
SEDICI_e11149d9c5f38e959d6f106383de1776 |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/141644 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
A primal heuristic for the routing and spectrum assignment problemBianchetti, MarceloMarenco, JavierCiencias InformáticasExgrid optical networkRouting and spectrum allocationInteger programmingIn 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 Operativa2021-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionResumenhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf17-17http://sedici.unlp.edu.ar/handle/10915/141644enginfo:eu-repo/semantics/altIdentifier/url/http://50jaiio.sadio.org.ar/pdfs/siiio/SIIIO-04.pdfinfo:eu-repo/semantics/altIdentifier/issn/2618-3277info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/3.0/Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:35:54Zoai:sedici.unlp.edu.ar:10915/141644Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:35:55.02SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
A primal heuristic for the routing and spectrum assignment problem |
title |
A primal heuristic for the routing and spectrum assignment problem |
spellingShingle |
A primal heuristic for the routing and spectrum assignment problem Bianchetti, Marcelo Ciencias Informáticas Exgrid optical network Routing and spectrum allocation Integer programming |
title_short |
A primal heuristic for the routing and spectrum assignment problem |
title_full |
A primal heuristic for the routing and spectrum assignment problem |
title_fullStr |
A primal heuristic for the routing and spectrum assignment problem |
title_full_unstemmed |
A primal heuristic for the routing and spectrum assignment problem |
title_sort |
A primal heuristic for the routing and spectrum assignment problem |
dc.creator.none.fl_str_mv |
Bianchetti, Marcelo Marenco, Javier |
author |
Bianchetti, Marcelo |
author_facet |
Bianchetti, Marcelo Marenco, Javier |
author_role |
author |
author2 |
Marenco, Javier |
author2_role |
author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas Exgrid optical network Routing and spectrum allocation Integer programming |
topic |
Ciencias Informáticas Exgrid optical network Routing and spectrum allocation Integer programming |
dc.description.none.fl_txt_mv |
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 |
description |
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. |
publishDate |
2021 |
dc.date.none.fl_str_mv |
2021-10 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Resumen http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/141644 |
url |
http://sedici.unlp.edu.ar/handle/10915/141644 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/http://50jaiio.sadio.org.ar/pdfs/siiio/SIIIO-04.pdf info:eu-repo/semantics/altIdentifier/issn/2618-3277 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/3.0/ Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/3.0/ Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0) |
dc.format.none.fl_str_mv |
application/pdf 17-17 |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1844616238144159744 |
score |
13.070432 |