Filtering algorithms for the multiset ordering constraint

DOI10.1016/j.artint.2008.11.001zbMath1191.68633OpenAlexW2121286910MaRDI QIDQ835808

Alan M. Frisch, Zeynep Kiziltan, Brahim Hnich, Toby Walsh, Ian Miguel

Publication date: 31 August 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2008.11.001

zbMATH Keywords

modellingconstraint propagationsymmetry breakingconstraint satisfactionconstraint programmingglobal constraintspropagation algorithmsmultiset orderingleximin optimal solutions

Mathematics Subject Classification ID

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

Related Items (3)

Computing leximin-optimal solutions in constraint networks ⋮ Automated streamliner portfolios for constraint satisfaction problems ⋮ Fuzzy multiset finite automata and their languages

Uses Software

• CPLEX
• WSAT(OIP)
• SICStus
• cc(FD)
• FaCiLe

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete bound consistency for the global cardinality constraint
• Computing leximin-optimal solutions in constraint networks
• Consistency in networks of relations
• Integer optimization by local search. A domain-independent approach
• Principles and practice of declarative programming. International conference PPDP '99. Paris, France, September 29--October 1, 1999. Proceedings
• Optimal narrowing of a block of sortings in optimal time
• Principles of Constraint Programming
• Design, implementation, and evaluation of the constraint language cc(FD)
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Filtering algorithms for the multiset ordering constraint