- -

The Windy Clustered Prize-Collecting Arc-Routing Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by


The Windy Clustered Prize-Collecting Arc-Routing Problem

Show full item record

Corberan, Á.; Fernandez, E.; Franquesa, C.; Sanchís Llopis, JM. (2011). The Windy Clustered Prize-Collecting Arc-Routing Problem. Transportation Science. 45(3):317-334. doi:10.1287/trsc.1110.0370

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

Files in this item

Item Metadata

Title: The Windy Clustered Prize-Collecting Arc-Routing Problem
Author: Corberan, Ángel Fernandez, Elena Franquesa, Carles 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:
This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent ...[+]
Subjects: Arc routing , Cutting plane algorithms , Polyhedral modelling , Arc routing problems , Computational experiment , Numerical results , Prize-collecting , Separation problems , Valid inequality , Profitability , Mathematical programming
Copyrigths: Cerrado
Transportation Science. (issn: 0041-1655 ) (eissn: 1526-5447 )
DOI: 10.1287/trsc.1110.0370
INFORMS (Institute for Operations Research and Management Sciences)
Publisher version: http://dx.doi.org/10.1287/trsc.1110.0370
The authors thank the Ministerio de Educacion y Ciencia of Spain ( Projects MTM2009-14039-C06-02 and MTM2009-14039-C06-05) for its support. They also thank the associate editor and three anonymous referees for their careful ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record