Sciweavers

440 search results - page 17 / 88
» Local Search Heuristics for the Multidimensional Assignment ...
Sort
View
JAR
2000
149views more  JAR 2000»
13 years 7 months ago
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
Patrick Mills, Edward P. K. Tsang
HEURISTICS
2008
153views more  HEURISTICS 2008»
13 years 7 months ago
Bringing order into the neighborhoods: relaxation guided variable neighborhood search
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
Jakob Puchinger, Günther R. Raidl
ICCV
2009
IEEE
13 years 5 months ago
Tracking a large number of objects from multiple views
We propose a multi-object multi-camera framework for tracking large numbers of tightly-spaced objects that rapidly move in three dimensions. We formulate the problem of finding co...
Zheng Wu, Nickolay I. Hristov, Tyson L. Hedrick, T...
FLAIRS
2006
13 years 9 months ago
Tabu Search for a Car Sequencing Problem
The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was propos...
Nicolas Zufferey, Martin Studer, Edward A. Silver
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
13 years 11 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch