The Windy clustered prize-collecting arc-routing problem

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/13482

dc.contributor	Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa
dc.contributor	Universitat Politècnica de Catalunya. PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació
dc.contributor.author	Corberan, Angel
dc.contributor.author	Fernández Aréizaga, Elena
dc.contributor.author	Franquesa Niubó, Carles
dc.contributor.author	Sanchis, Jose Maria
dc.date	2011-08
dc.identifier.citation	Corberan, A. [et al.]. The Windy clustered prize-collecting arc-routing problem. "Transportation science", Agost 2011, vol. 45, núm. 3, p. 317-334.
dc.identifier.citation	0041-1655
dc.identifier.citation	10.1287/trsc.1110.0370
dc.identifier.uri	http://hdl.handle.net/2117/13482
dc.language.iso	eng
dc.relation	http://transci.journal.informs.org/content/45/3/317.abstract
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject	Algorithms
dc.subject	68W Algorithms
dc.title	The Windy clustered prize-collecting arc-routing problem
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	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 of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author