303 search results - page 52 / 61 » Traveling Salesman Problem with Transportation |
122
click to vote
FOCS
2006
IEEE
15 years 8 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...
113
Voted
FOCS
2006
IEEE
15 years 8 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...
119
Voted
HM
2005
Springer
15 years 7 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...
115
Voted
PVM
2004
Springer
15 years 7 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....
121
click to vote
CEC
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract-- Recently, the research on quantum-inspired evolutionary algorithms (QEA) has attracted some attention in the area of evolutionary computation. QEA use a probabilistic re...