Sciweavers

1142 search results - page 4 / 229
» Set Variables and Local Search
Sort
View
AAAI
1997
13 years 7 months ago
Variable-Selection Heuristics in Local Search for SAT
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
Alex S. Fukunaga
FLAIRS
2003
13 years 7 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
COR
2006
108views more  COR 2006»
13 years 5 months ago
Variable neighborhood search and local branching
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
CP
2008
Springer
13 years 7 months ago
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
Wanxia Wei, Chu Min Li, Harry Zhang