1171 search results - page 52 / 235 » Variable neighborhood search |
AIMSA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
60
Voted
CONSTRAINTS
2007
14 years 9 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
83
Voted
IJAIT
2007
14 years 9 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
113
click to vote
DISOPT
2011
14 years 4 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
GI
2007
Springer
15 years 3 months ago
2007
Springer
: Many automated visual inspection applications rely on a segmentation of surfaces into meaningful regions, for instance into defective and non-defective areas. This paper presents...