Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...
The Extended Global Cardinality Constraint (EGCC) is a vital component of constraint solving systems, since it is very widely used to model diverse problems. The literature contai...
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...
Yuri Malitsky, Meinolf Sellmann, Willem Jan van Ho...