A Domain Consistency Algorithm for the Stretch Constraint-Reference-Cited by-同舟云学术

A Domain Consistency Algorithm for the Stretch Constraint

Published:2004 Issue: Volume: Page:290-304
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP 2004
language:
Short-container-title:

Author:

Hellsten Lars,Pesant Gilles,van Beek Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30201-8_23

Reference7 articles.

1. Beldiceanu, N.: Pruning for the cardinality-path constraint family. Technical Report T2001/11A, SICS (2001)

2. Bessière, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of global constraints. In: Proceedings of the Nineteenth National Conference on Artificial Intelligence, San Jose, California (2004)

3. ILOG S. A. ILOG Solver 4.2 user’s manual (1998)

4. Laporte, G., Pesant, G.: A general multi-shift scheduling system. J. of the Operational Research Society (2004) (accepted for publication)

5. Pesant, G.: A filtering algorithm for the stretch constraint. In: Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming, Paphos, Cyprus, pp. 183–195 (2001)

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

1. An Introduction of FD-Complete Constraints;IFIP Advances in Information and Communication Technology;2020

2. The Regularization of Small Sub-Constraint Satisfaction Problems;Declarative Programming and Knowledge Management;2020

3. The Regularization of CSPs for Rostering, Planning and Resource Management Problems;IFIP Advances in Information and Communication Technology;2018

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

5. Forward-Checking Filtering for Nested Cardinality Constraints: Application to an Energy Cost-Aware Production Planning Problem for Tissue Manufacturing;Integration of AI and OR Techniques in Constraint Programming;2016