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

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Autor principal: Aráoz, Julián (author)
Outros Autores: Fernández, Elena (author), Franquesa, Carles (author)
Formato: article
Publicado em: 2017
Assuntos:
Arc routing
Polyhedral modeling
Routing
Facets
Valid inequalities
Mathematical programming
CPLEX
Branch and cut
TSP
Acesso em linha: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: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma 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

Registos relacionados