Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The generalized arc routing problem

Autor
Araoz, J.; Fernandez, E.; Franquesa, C.
Tipus d'activitat
Article en revista
Revista
TOP
Data de publicació
2017-10
Volum
25
Número
3
Pàgina inicial
497
Pàgina final
525
DOI
https://doi.org/10.1007/s11750-017-0437-4 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/114843 Obrir en finestra nova
URL
https://link.springer.com/article/10.1007%2Fs11750-017-0437-4 Obrir en finestra nova
Resum
The final publication is available at Springer via http://dx.doi.org/10.1007/s11750-017-0437-4 This paper focuses on the generalized arc routing problem. This problem is stated on an undirected graph in which some clusters are defined as pairwise-disjoint connected subgraphs, and a route is sought that traverses at least one edge of each cluster. Broadly speaking, the generalized arc routing problem is the arc routing counterpart of the generalized traveling salesman problem, where the set of ve...
Citació
Araoz, J., Fernandez, E., Franquesa, C. The generalized arc routing problem. "TOP", Octubre 2017, vol. 25, núm. 3, p. 497-525.
Paraules clau
Arc routing, Branch and cut, CPLEX, Facets, Mathematical programming, Operations research, Polyhedral modeling, Routing, TSP, Valid inequalities
Grup de recerca
GNOM - Grup d'Optimització Numèrica i Modelització

Participants