The traveling salesman problem for cubic graphs.

Eppstein, David

Displaying similar documents to “The traveling salesman problem for cubic graphs.”

Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results

A. Benkouar, Y. Manoussakis, V. Th. Paschos, R. Saad (1996)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Clustering cycles into cycles of clusters.

Cortese, Pier Francesco, Di Battista, Giuseppe, Patrignani, Maurizio, Pizzonia, Maurizio (2005)

Journal of Graph Algorithms and Applications

Similarity:

Two-layer planarization: improving on parameterized algorithmics.

Fernau, Henning (2005)

Journal of Graph Algorithms and Applications

Similarity:

Embedding vertices at points: Few bends suffice for planar graphs.

Kaufmann, Michael, Wiese, Roland (2002)

Journal of Graph Algorithms and Applications

Similarity:

The Capacitated Arc Routing Problem. A heuristic algorithm.

Enrique. Benavent, V. Campos, Angel Corberán, Enrique Mota (1990)

Qüestiió

Similarity:

In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific vertex (the depot) and with a known capacity Q, must service a subset of the edges of the graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity. A heuristic algorithm for this problem is proposed consisting of: the selection of K centers, the construction of K connected graphs with associated loads...