Mostrar el registro completo del ítem
Ávila, T.; Corberán, Á.; Plana, I.; Sanchís Llopis, JM. (2016). A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem. Transportation Science. 50(2):750-761. https://doi.org/10.1287/trsc.2015.0588
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/84205
Título: | A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem | |
Autor: | Ávila, Thais Corberán, Ángel Plana, Isaac Sanchís Llopis, José María | |
Entidad UPV: |
|
|
Fecha difusión: |
|
|
Resumen: |
The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an
arc routing problem with some interesting real-life applications, such as routing for meter reading. In this
article ...[+]
|
|
Palabras clave: |
|
|
Derechos de uso: | Reconocimiento - No comercial (by-nc) | |
Fuente: |
|
|
DOI: |
|
|
Editorial: |
|
|
Versión del editor: | http://doi.org/10.1287/trsc.2015.0588 | |
Código del Proyecto: |
|
|
Agradecimientos: |
The authors wish to thank Minh Hoang Ha, Nathalie Bostel, Andre Langevin, and Louis-Martin Rousseau for providing their instances. The authors also thank the Spanish Ministerio de Economia y Competitividad [project ...[+]
|
|
Tipo: |
|