155 search results - page 20 / 31 » A Conflict Tabu Search Evolutionary Algorithm for Solving Co... |
137
Voted
CP
1998
Springer
15 years 8 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
114
click to vote
ICTAI
2007
IEEE
15 years 10 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
126
Voted
CP
1998
Springer
15 years 8 months ago
1998
Springer
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
135
Voted
JAIR
2010
15 years 2 months ago
2010
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
142
Voted
CP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...