DMCA
An Arc-Consistency Algorithm for the (2002)
Cached
Download Links
- [www.cs.brown.edu]
- [cs.brown.edu]
- [www.cs.brown.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP 2002), volume 2470 of LNCS |
BibTeX
@INPROCEEDINGS{All02anarc-consistency,
author = {Minimum Weight All and Meinolf Sellmann},
title = {An Arc-Consistency Algorithm for the},
booktitle = {Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP 2002), volume 2470 of LNCS},
year = {2002},
pages = {744--749},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
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 arcconsistency (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.
