lbc.hpp File Reference

(Revision: 7678)

Go to the source code of this file.

Namespaces

namespace Gecode

Gecode toplevel namespace.

namespace Gecode::Int

Finite domain integers.

namespace Gecode::Int::GCC

Global cardinality propagators.

Functions

template<class View , class Card , bool shared>

ExecStatus Gecode::Int::GCC::lbc (Space &home, ViewArray< View > &x, int &nb, HallInfo hall[], Rank rank[], PartialSum< Card > *lps, int mu[], int nu[])

Lower Bounds constraint (LBC) stating $\forall j \in \{0, \dots, |k|-1\}: \#\{i\in\{0, \dots, |x| - 1\} | x_i = card(k_j)\} \geq min(k_j)$ Hence the lbc constraints the variables such that every value occurs at least as often as specified by its lower cardinality bound.


Namespaces
namespace	Gecode
	Gecode toplevel namespace.
namespace	Gecode::Int
	Finite domain integers.
namespace	Gecode::Int::GCC
	Global cardinality propagators.
Functions
template<class View , class Card , bool shared>
ExecStatus	Gecode::Int::GCC::lbc (Space &home, ViewArray< View > &x, int &nb, HallInfo hall[], Rank rank[], PartialSum< Card > *lps, int mu[], int nu[])
	Lower Bounds constraint (LBC) stating $\forall j \in \{0, \dots, \|k\|-1\}: \#\{i\in\{0, \dots, \|x\| - 1\} \| x_i = card(k_j)\} \geq min(k_j)$ Hence the lbc constraints the variables such that every value occurs at least as often as specified by its lower cardinality bound.