439 search results - page 4 / 88 » Neighborhood Structures for GPU-Based Local Search Algorithm... |
IAT
2007
IEEE
14 years 3 months ago
2007
IEEE
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
HEURISTICS
2002
13 years 8 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
SIGMOD
2011
ACM
12 years 11 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
HM
2009
Springer
14 years 1 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
LION
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...