A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint
| dc.creator | van Hoeve, Willem Jan | |
| dc.date | 2004-07-16 | |
| dc.date.accessioned | 2026-07-07T03:21:34Z | |
| dc.date.available | 2026-07-07T03:21:34Z | |
| dc.description | 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. | |
| dc.description | 11 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/cs/0407043 | |
| dc.identifier | http://arxiv.org/abs/cs/0407043 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32252 | |
| dc.subject | Programming Languages | |
| dc.subject | D.3.2; D.3.3; G.2.2 | |
| dc.title | A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint | |
| dc.type | text |