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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Aráoz, Julián (author)
Weitere Verfasser: Fernández, Elena (author), Franquesa, Carles (author)
Format: article
Veröffentlicht: 2017
Schlagworte:
Arc routing
Polyhedral modeling
Routing
Facets
Valid inequalities
Mathematical programming
CPLEX
Branch and cut
TSP
Online Zugang: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: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

Online

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

Ähnliche Einträge