332 search results - page 52 / 67 » Traveling salesman path problems |
KES
2007
Springer
14 years 2 months ago
2007
Springer
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
HM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
PVM
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....