This is a preview. Log in through your library . Abstract Model equivalences may sometimes be used to replace 'realistic' but unwieldy initial formulations with simpler counterparts. This can involve ...

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 ...

can be solved by solving an equivalent linear complementarity problem when H is positive semidefinite. The approach is outlined in the discussion of the LCP subroutine in Chapter 17, "Language ...