Multiconsistency and robustness with global constraints

DOI10.1007/s10601-006-9004-6zbMath1114.68066OpenAlexW2054655914MaRDI QIDQ857890

Irit Katriel, Khaled M. Elbassioni

Publication date: 5 January 2007

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-006-9004-6

zbMATH Keywords

AlldifferentArc-consistencyFiltering algorithmsGlobal cardinality constraintGlobal constraintsMulti-consistencyRobust solutions

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Finding all the perfect matchings in bipartite graphs
• Optimal narrowing of a block of sortings in optimal time
• Approximating the Permanent
• Principles of Constraint Programming
• Algorithms – ESA 2004
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Multiconsistency and robustness with global constraints