Arc-Consistency for a Chain of Lexicographic Ordering Constraints
نویسندگان
چکیده
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.
منابع مشابه
A revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers
In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...
متن کاملPropagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constraint programming to a problem, it is modelled by a set of constraints on a set of decision variables. A common modelling pattern is the use of matrices of decision variables. The rows and/or columns of these matrices are ...
متن کاملSix Ways of Integrating Symmetries within Non-overlapping Constraints
This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-rectangles) subject to the fact that they should not pairwise overlap. While the first two ways deal with the integration of a chain of lexicographic ordering constraint within a generic geometric constraint kernel, the four latter ...
متن کاملGlobal Constraints for Lexicographic Orderings
We propose some global constraints for lexicographic orderings on vectors of variables. These constraints are very useful for breaking a certain kind of symmetry arising in matrices of decision variables. We show that decomposing such constraints carries a penalty either in the amount or the cost of constraint propagation. We therefore present a global consistency algorithm which enforces a lex...
متن کاملFrom Constraints to Finite Automata to Filtering Algorithms
We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two case studies of constraints on vectors of variables. This has enabled us to derive an incremental filtering algorithm that runs in O(n) plus amortized O(1) time per propagation event for the lexicographic ordering constraint over tw...
متن کامل