930 search results - page 4 / 186 » An Improved Approximation Algorithm for the Traveling Tourna... |
CPAIOR
2006
Springer
13 years 9 months ago
2006
Springer
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
CCE
2004
13 years 5 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
DISOPT
2010
13 years 5 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
It is shown that the traveling salesman problem for graphs
CCCG
2010
13 years 6 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...