Arc-Consistency for a Chain of Lexicographic Ordering Constraints
Number of Authors: 2
2002 (English)Report (Refereed)
We present an arc-consistency algorithm for a chain of lexicographic ordering constraints on $m$ vectors of $n$ variables each. The algorithm maintains arc-consistency and runs in $O(nmd)$ time per invocation, where $d$ is the cost of certain domain operations.
Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 2002, 1. , 14 p.
SICS Technical Report, ISSN 1100-3154 ; 2002:18
Constraint Programming, Global Constraints, Lexicographic Ordering, Symmetry
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-21992OAI: oai:DiVA.org:ri-21992DiVA: diva2:1041534