26 search results - page 5 / 6 » Decomposition During Search for Propagation-Based Constraint... |
82
Voted
ICTAI
2003
IEEE
15 years 2 months ago
2003
IEEE
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
AI
2006
Springer
14 years 9 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
JAIR
2011
14 years 4 months ago
2011
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...
77
Voted
EVOW
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. A methodology is presented for tackling mixed-integer nonlinear optimization problems by local search, in particular large-scale real-life problems. This methodology is i...
80
Voted
HEURISTICS
2010
14 years 6 months ago
2010
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...