Mostrar el registro completo del ítem
Corberan, A.; Letchford, A.; Sanchís Llopis, JM. (2001). A cutting plane algorithm for the General Routing Problem. Mathematical Programming. 90(2):291-316. https://doi.org/10.1007/PL00011426
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/100424
Título: | A cutting plane algorithm for the General Routing Problem | |
Autor: | Corberan, Angel Letchford, Adam | |
Entidad UPV: |
|
|
Fecha difusión: |
|
|
Resumen: |
[EN] The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural ...[+]
|
|
Palabras clave: |
|
|
Derechos de uso: | Reserva de todos los derechos | |
Fuente: |
|
|
DOI: |
|
|
Editorial: |
|
|
Versión del editor: | https://doi.org/10.1007/PL00011426 | |
Código del Proyecto: |
|
|
Agradecimientos: |
The authors would like to thank three anonymous referees for their helpful comments and suggestions that have greatly improved the contents and presentation of the paper. The contribution by A. Corberán & J.M. Sanchis has ...[+]
|
|
Tipo: |
|