- -

Min-Max K-vehicles Windy Rural Postman Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by


Min-Max K-vehicles Windy Rural Postman Problem

Show full item record

Benavent López, E.; Corberan, A.; Plana, I.; Sanchís Llopis, JM. (2009). Min-Max K-vehicles Windy Rural Postman Problem. Networks. 54(4):216-226. https://doi.org/10.1002/net.20334

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/150418

Files in this item

Item Metadata

Title: Min-Max K-vehicles Windy Rural Postman Problem
Author: Benavent López, Enrique Corberan, Angel Plana, Isaac Sanchís Llopis, José María
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Issued date:
[EN] In this article the Min-Max version of the windy rural postman problem with several vehicles is introduced. For this problem, in which the objective is to minimize the length of the longest tour in order to find a set ...[+]
Subjects: Rural postman problem , Windy postman problem , Windy rural postman problem , Facets , Multivehicles
Copyrigths: Reserva de todos los derechos
Networks. (issn: 0028-3045 )
DOI: 10.1002/net.20334
John Wiley & Sons
Publisher version: https://doi.org/10.1002/net.20334
Project ID:
Contract grant sponsor: Ministerio de Education y Ciencia of Spain: Contract gram number: MTM2006-14961-C05-02
Type: Artículo

This item appears in the following Collection(s)

Show full item record