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

Descrición completa

Gardado en:
Detalles Bibliográficos
Autor Principal: Aráoz, Julián (author)
Outros autores: Fernández, Elena (author), Franquesa, Carles (author)
Formato: article
Publicado: 2017
Subjects:
Arc routing
Polyhedral modeling
Routing
Facets
Valid inequalities
Mathematical programming
CPLEX
Branch and cut
TSP
Acceso en liña: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: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!

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

Títulos similares