The Objective Sum Constraint-Reference-Cited by-同舟云学术

The Objective Sum Constraint

Published:2011 Issue: Volume: Page:190-195
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
language:
Short-container-title:

Author:

Régin Jean-Charles,Petit Thierry

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-21311-3_18

Reference5 articles.

1. Kovács, A., Beck, J.C.: A global constraint for total weighted completion time for cumulative resources. Constraints (2010) (in print)

2. Larrosa, J., Meseguer, P., Schiex, T., Verfaillie, G.: Reversible DAC and other improvements for solving Max-CSP. Proceedings AAAI, pp. 347–352 (1998)

3. Larsson, T., Patriksson, M.: On side constrained models of traffic equilibria. In: Proc. of the 19th Course of the International School of Mathematics, pp. 169–178. Plenum Press, New York (1995)

4. Petit, T., Poder, E.: Global propagation of side constraints for solving over-constrained problems. Annals of Operations Research 184, 295–315 (2011)

5. Lecture Notes in Computer Science;J.-C. Régin,2000

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

1. A parametric propagator for pairs of Sum constraints with a discrete convexity property;Artificial Intelligence;2016-12

2. A Filtering Algorithm for Constrained Clustering with Within-Cluster Sum of Dissimilarities Criterion;2013 IEEE 25th International Conference on Tools with Artificial Intelligence;2013-11

3. Variable Objective Large Neighborhood Search: A Practical Approach to Solve Over-Constrained Problems;2013 IEEE 25th International Conference on Tools with Artificial Intelligence;2013-11

4. A Parametric Propagator for Discretely Convex Pairs of Sum Constraints;Lecture Notes in Computer Science;2013