In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
This paper treats the problem of managing personal tasks, through an adaptation of the Squeaky Wheel Optimization (SWO) framework, enhanced with powerful heuristics and full const...
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avo...
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...