The Windy clustered prize-collecting arc-routing problem
Visualitza/Obre
317.full.pdf (316,5Kb) (Accés restringit)
Cita com:
hdl:2117/13482
Tipus de documentArticle
Data publicació2011-08
Condicions d'accésAccés restringit per acord de confidencialitat
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
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.
CitacióCorberan, A. [et al.]. The Windy clustered prize-collecting arc-routing problem. "Transportation science", Agost 2011, vol. 45, núm. 3, p. 317-334.
ISSN0041-1655
Versió de l'editorhttp://transci.journal.informs.org/content/45/3/317.abstract
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
317.full.pdf | 316,5Kb | Accés restringit |