- -

New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Windy Rural Postman Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Windy Rural Postman Problem

Show full item record

Benavent López, E.; Corberán, A.; Plana, I.; Sanchís Llopis, JM. (2011). New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Windy Rural Postman Problem. Networks. 58(4):255-272. https://doi.org/10.1002/net.20469

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

Files in this item

Item Metadata

Title: New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Windy Rural Postman Problem
Author: Benavent López, Enrique Corberán, 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:
Abstract:
[EN] The min-max windy rural postman problem is a multiple vehicle version of the windy rural postman problem, WRPP, which consists of minimizing the length of the longest route to find a set of balanced routes for the ...[+]
Subjects: Facets , Multivehicle , Rural postman problem , Windy postman problem , Windy rural postman problem , Multi-vehicles , Postman problems , Windy rural postman problems , Algorithms
Copyrigths: Reserva de todos los derechos
Source:
Networks. (issn: 0028-3045 )
DOI: 10.1002/net.20469
Publisher:
WILEY-BLACKWELL
Publisher version: https://doi.org/10.1002/net.20469
Thanks:
Contract grant sponsor: Ministerio de Ciencia e Innovacion of Spain; Contract grant numbers: MTM2006-14961-C05-02, MTM2009-14039-C06-02
Type: Artículo

This item appears in the following Collection(s)

Show full item record