272 search results - page 31 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
142
Voted
CPAIOR
2006
Springer
15 years 7 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...
212
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
158
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
106
Voted
GECCO
2000
Springer
15 years 7 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
116
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...