We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Abstract. Constraint programming offers powerful problem solving capabilities, but experienced and skilled developers are needed to maximise the benefits it offers. We introduce...
James Little, Cormac Gebruers, Derek G. Bridge, Eu...
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...