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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2017
|
| Subjects: | |
| Online Access: | 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: |
Add Tag
No Tags, Be the first to tag this record!
|
Add Tag 
