A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint

Details A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint

2004-07-16

arxiv.org/abs/cs/0407043v1

Computer Science

Programming Languages

11 pages, 1 figure

Scientific paper

This paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flow problem. Consistency of the constraint can be checked in O(nm) time, and hyper-arc consistency is achieved in O(m) time, where n is the number of variables involved and m is the sum of the cardinalities of the domains. It improves a previous method that did not ensure hyper-arc consistency.

Affiliated with

Also associated with

No associations

Rating

A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-636293