This is a preview. Log in through your library . Abstract A method is given for maximizing a linear function subject to a quadratic and a number of linear constraints. The method differs from general ...

Constraint Programming (CP) has been successful in a number of combinatorial search and discrete optimisation problems. Yet other more traditional approaches, such as Integer Programming (IP), can ...