An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint

Authors:
Meinolf Sellmann
Affiliations:
-
Venue:
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Year:
2002

Citing 4
Cited 4

Introduction to algorithms

Introduction to algorithms
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Heuristics for Large Constrained Vehicle Routing Problems

Journal of Heuristics
Cost-Based Domain Filtering

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming

Cost-based Filtering for Shorter Path Constraints

Constraints
A global constraint for total weighted completion time for cumulative resources

Engineering Applications of Artificial Intelligence
Approximated consistency for the automatic recording constraint

Computers and Operations Research
A global constraint for total weighted completion time for unary resources

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Historically, discrete minimization problems in constrained logical programming were modeled with the help of an isolated bounding constraint on the objective that is to be decreased. To overcome this frequently inefficient way of searching for improving solutions, the notion of optimization constraints was introduced. Optimization constraints can be viewed as global constraints that link the objective with other constraints of the problem at hand. We present an arc-consistency (actually: hyper-arc-consistency) algorithm for the minimum weight all different constraint which is an optimization constraint that consists in the combination of a linear objective with an all different constraint.