Per accedir als documents amb el text complet, si us plau, seguiu el següent enllaç: http://hdl.handle.net/2117/13482

The Windy clustered prize-collecting arc-routing problem
Corberan, Angel; Fernández Aréizaga, Elena; Franquesa Niubó, Carles; Sanchis, Jose Maria
Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa; Universitat Politècnica de Catalunya. PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació
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.
Peer Reviewed
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
Algorithms
68W Algorithms
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/publishedVersion
Article
         

Mostra el registre complet del document

Documents relacionats

Altres documents del mateix autor/a

Fernández Aréizaga, Elena
Bautista Valhondo, Joaquín; Fernández Aréizaga, Elena; Pereira Gude, Jordi
Fernández Aréizaga, Elena; Luna Mota, Carlos; Hildenbrandt, Achim; Reinelt, Gerard; Wiesberg, Stefan
Bautista Valhondo, Joaquín; Fernández Aréizaga, Elena; González, JL; Laguna, Manuel
Contreras, I.; Fernández Aréizaga, Elena; Marín, Alfredo