The Generalized Arc Routing Problem

The Generalized Arc Routing Problem

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...

Description complète

Enregistré dans:
Détails bibliographiques
Auteur principal: Aráoz, Julián (author)
Autres auteurs: Fernández, Elena (author), Franquesa, Carles (author)
Format: article
Publié: 2017
Sujets:
Arc routing
Polyhedral modeling
Routing
Facets
Valid inequalities
Mathematical programming
CPLEX
Branch and cut
TSP
Accès en ligne:http://repositorio.ikiam.edu.ec:8080/jspui/handle/RD_IKIAM/82
http://repositorio.ikiam.edu.ec/jspui/handle/RD_IKIAM/82
https://www.researchgate.net/publication/313458695
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!

Internet

http://repositorio.ikiam.edu.ec:8080/jspui/handle/RD_IKIAM/82
http://repositorio.ikiam.edu.ec/jspui/handle/RD_IKIAM/82
https://www.researchgate.net/publication/313458695

Documents similaires