Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The Windy clustered prize-collecting arc-routing problem

Autor
Corberan, A.; Fernandez, E.; Franquesa, C.; Sanchis, J.
Tipus d'activitat
Article en revista
Revista
Transportation science
Data de publicació
2011-08
Volum
45
Número
3
Pàgina inicial
317
Pàgina final
334
DOI
https://doi.org/10.1287/trsc.1110.0370 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/13482 Obrir en finestra nova
URL
http://transci.journal.informs.org/content/45/3/317.abstract Obrir en finestra nova
Resum
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 v...
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.
Grup de recerca
PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació

Participants

  • Corberan, Angel  (autor)
  • Fernandez Areizaga, Elena  (autor)
  • Franquesa Niubo, Carles  (autor)
  • Sanchis, Jose Maria  (autor)