scientific article; zbMATH DE number 2080035

zbMATH Open1044.68040MaRDI QIDQ4472222FDOQ4472222

Authors: Konrad Engel, Sven Hartmann 

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2284/22840268.htm

Title of this publication is not available (Why is that?)

Recommendations

• The extended global cardinality constraint: an empirical survey
• The complexity of global cardinality constraints
• An efficient bounds consistency algorithm for the global cardinality constraint
• An efficient bounds consistency algorithm for the global cardinality constraint
• Complete bound consistency for the global cardinality constraint
• Tractable cases of the extended global cardinality constraint
• Fast bound consistency for the global cardinality constraint
• scientific article; zbMATH DE number 1950752
• Principles and Practice of Constraint Programming – CP 2004
• A parametric approach for smaller and better encodings of cardinality constraints

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15)

Cited In (2)

• Consistency problems in ER-schemas for database systems
• Graph-theoretical methods to construct entity-relationship databases

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472222)