265 search results - page 2 / 53 » Neighborhood Composition: A Parallelization of Local Search ... |
PPL
2010
13 years 1 days ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
KES
1998
Springer
13 years 9 months ago
1998
Springer
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The availability of commodity multiprocessors offers significant opportunities for addressing the increasing computational requirements of optimization applications. To...
HM
2007
Springer
13 years 11 months ago
2007
Springer
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
CPAIOR
2010
Springer
13 years 10 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...