New filtering for AtMostNValue and its weighted variant: A Lagrangian approach

@article{Cambazard2015NewFF,
  title={New filtering for AtMostNValue and its weighted variant: A Lagrangian approach},
  author={Hadrien Cambazard and Jean-Guillaume Fages},
  journal={Constraints},
  year={2015},
  volume={20},
  pages={362-380}
}
The AtMostNValue global constraint, which restricts the maximum number of distinct values taken by a set of variables, is a well known NP-Hard global constraint. The weighted version of the constraint, AtMostWValue, where each value is associated with a weight or cost, is a useful and natural extension. Both constraints occur in many industrial applications where the number and the cost of some resources have to be minimized. This paper introduces a new filtering algorithm based on a Lagrangian… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 2 times. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Integer programming. Wiley-Interscience series in discrete mathmatics and optimization

L. A. Wolsey
1998
View 3 Excerpts
Highly Influenced

Lagrangean relaxation for integer programming. In Balinski, M.L. (Ed.) Approaches to integer programming, volume 2 of mathematical programming studies, (pp. 82–114)

A. M. Geoffrion
1974
View 3 Excerpts
Highly Influenced

Springer

F. Focacci, A. Lodi, +5 authors . Berlin Heidelberg
380 Constraints • 2015
View 1 Excerpt

Choco3 Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S

C. Prud’homme, Fages, J.-G, X. Lorca
2014
View 1 Excerpt

Np-hard contraints involving costs: examples of applications and filtering

H. Cambazard
In Dixièmes Journées Francophones de Programmation par Contraintes – JFPC • 2014
View 1 Excerpt

Similar Papers

Loading similar papers…