Arc Consistency for Global Cardinality Constraints with Costs-Reference-Cited by-同舟云学术

Arc Consistency for Global Cardinality Constraints with Costs

Published:1999 Issue: Volume: Page:390-404
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP’99
language:
Short-container-title:

Author:

Régin Jean-Charles

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-48085-3_28

Reference12 articles.

1. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice Hall, Englewood Cliffs (1993)

2. Beldiceanu, N., Contejean, E.: Introducing global constraints in chip. Journal of Mathematical and Computer Modelling 20(12), 97–123 (1994)

3. Lecture Notes in Computer Science;Y. Caseau,1993

4. Caseau, Y., Laburthe, F.: Solving various weighted matching problems with constraints. In: Proceedings CP 1997, Austria, pp. 17–31 (1997)

5. Cherkassky, B., Goldberg, A., Radzik, T.: Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming 73, 129–174 (1996)

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2020

2. Constraint programming and operations research;Constraints;2017-12-29

3. Constrained Minimum Sum of Squares Clustering by Constraint Programming;Lecture Notes in Computer Science;2015

4. Improved Constraint Propagation via Lagrangian Decomposition;Lecture Notes in Computer Science;2015

5. Explaining Propagators for Edge-Valued Decision Diagrams;Lecture Notes in Computer Science;2013