Mostrar el registro completo del ítem
Bianchessi, N.; Corberán, Á.; Plana, I.; Reula, M.; Sanchís Llopis, JM. (2022). The min-max close-enough arc routing problem. European Journal of Operational Research. 300(3):837-851. https://doi.org/10.1016/j.ejor.2021.10.047
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/196713
Título: | The min-max close-enough arc routing problem | |
Autor: | Bianchessi, Nicola Corberán, Ángel Plana, Isaac Reula, Miguel | |
Entidad UPV: |
|
|
Fecha difusión: |
|
|
Resumen: |
[EN] Here we introduce the Min-Max Close-Enough Arc Routing Problem, where a fleet of vehicles must serve a set of customers while trying to balance the length of the routes. The vehicles do not need to visit the customers, ...[+]
|
|
Palabras clave: |
|
|
Derechos de uso: | Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) | |
Fuente: |
|
|
DOI: |
|
|
Editorial: |
|
|
Versión del editor: | https://doi.org/10.1016/j.ejor.2021.10.047 | |
Código del Proyecto: |
|
|
Agradecimientos: |
The work by Angel Corberan, Isaac Plana, Miguel Reula, and Jose M. Sanchis was supported by the Spanish Ministerio de Ciencia, Innovacion y Universidades (MICIU) and Fondo Social Europeo (FSE) through project PGC2018-099428-B-I00. ...[+]
|
|
Tipo: |
|