Tractable cases of the extended global cardinality constraint

We study the consistency and domain 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 for each variable x , and a “cardinality set” K ( d ) of non-negative integers for each value d . The probl...

Full description

Saved in:

Bibliographic Details
Published in:	Constraints : an international journal Vol. 16; no. 1; pp. 1 - 24
Main Authors:	Samer, Marko, Szeider, Stefan
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.01.2011 Springer
Subjects:	Applied sciences Artificial Intelligence Computer Science Computer science; control theory; systems Exact sciences and technology Flows in networks. Combinatorial problems Information retrieval. Graph Operational research and scientific management Operational research. Management science Operations Research/Decision Theory Optimization Theoretical computing Domain consistency Bounded treewidth Global constraints General factor problem Parameterized complexity Constraint satisfaction Linear time Treewidth Constrained optimization Polynomial time Multiplicity NP complete problem Bipartite graph Graph matching
ISSN:	1383-7133, 1572-9354
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!