Constraint programming (CP) is a programming paradigm where relations between variables are stated in the form of constraints. It's particularly useful for solving complex combinatorial problems such ...

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

In this paper we consider ambiguous stochastic constraints under partial information consisting of means and dispersion measures of the underlying random parameters. Whereas the past literature used ...

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