66 search results - page 6 / 14 » The Polytope of Tree-Structured Binary Constraint Satisfacti... |
AAAI
2007
13 years 9 months ago
2007
Solving logic puzzles has become a very popular past-time, particularly since the Sudoku puzzle started appearing in newspapers all over the world. We have developed a puzzle gene...
CP
2001
Springer
13 years 12 months ago
2001
Springer
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
MOR
2002
13 years 7 months ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...