66 search results - page 1 / 14 » The Polytope of Tree-Structured Binary Constraint Satisfacti... |
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
CPAIOR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
ECAI
2008
Springer
13 years 6 months ago
2008
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
AAAI
1998
13 years 5 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
CPAIOR
2007
Springer
13 years 10 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...