Sciweavers

749 search results - page 31 / 150
» Dualities for Constraint Satisfaction Problems
Sort
View
AMAI
1999
Springer
14 years 10 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
DAGSTUHL
2008
15 years 8 days ago
Recent Results on the Algebraic Approach to the CSP
Abstract. We describe an algebraic approach to the constraint satisfaction problem (CSP) and present recent results on the CSP that make use of, in an essential way, this algebraic...
Andrei A. Bulatov, Matthew Valeriote
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
14 years 8 months ago
Constraint propagation on quadratic constraints
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
Ferenc Domes, Arnold Neumaier
CPAIOR
2006
Springer
15 years 2 months ago
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma...
81
Voted
SIAMDM
2008
90views more  SIAMDM 2008»
14 years 10 months ago
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
Andrei A. Krokhin, Benoit Larose