20 search results - page 1 / 4 » cpaior 2007 |
CPAIOR
2007
Springer
14 years 5 months ago
2007
Springer
CPAIOR
2007
Springer
14 years 5 months ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
CPAIOR
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...
CPAIOR
2007
Springer
14 years 5 months ago
2007
Springer
In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...
CPAIOR
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...