272 search results - page 14 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
SODA
2001
ACM
13 years 9 months ago
2001
ACM
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
CSJM
2006
13 years 8 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
FUN
2007
Springer
14 years 8 days ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
ALGORITHMICA
2005
13 years 8 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...