440 search results - page 14 / 88 » Local Search Heuristics for the Multidimensional Assignment ... |
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— This paper presents a search-based, real-time adaptive solution to the multi-robot coordination problem in adversarial environments. By decomposing the global coordinat...
IDA
2003
Springer
14 years 26 days ago
2003
Springer
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
GECCO
2009
Springer
14 years 8 days ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
IJAIT
2010
13 years 6 months ago
2010
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...