Change search
ReferencesLink to record
Permanent link

Direct link
Arc-Consistency for a Chain of Lexicographic Ordering Constraints
Number of Authors: 2
2002 (English)Report (Refereed)
Abstract [en]

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
Keyword [en]
Constraint Programming, Global Constraints, Lexicographic Ordering, Symmetry
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14180OAI: diva2:1035468
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(163 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 163 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link