311 search results - page 1 / 63 » Exploiting Decomposition in Constraint Optimization Problems |
CP
2009
Springer
13 years 11 months ago
2009
Springer
Multi-objective optimization is concerned with problems involving multiple measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-...
CP
2008
Springer
13 years 6 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
IJCAI
2007
13 years 6 months ago
2007
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...