332 search results - page 36 / 67 » Traveling salesman path problems |
ALGORITHMICA
2005
13 years 7 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...
COLING
2010
13 years 2 months ago
2010
In this paper we propose a novel algorithm for opinion summarization that takes account of content and coherence, simultaneously. We consider a summary as a sequence of sentences ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
GECCO
2000
Springer
13 years 11 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...