Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint-Reference-Cited by-同舟云学术

Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint

Published:2001 Issue: Volume: Page:377-391
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming — CP 2001
language:
Short-container-title:

Author:

Beldiceanu Nicolas,Carlsson Mats

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45578-7_26

Reference13 articles.

1. A. Aggoun and N. Beldiceanu. Extending CHIP in order to solve complex scheduling and placementproblems. Mathl. Comput. Modelling, 17(7):57–73, 1993.

2. N. Beldiceanu. Global constraints as graph properties on structured network of elementary constraints of the same type. SICS Technical Report T2000/01, Swedish Institute of Computer Science, 2000.

3. N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. Mathl. Comput. Modelling, 20(12):97–123, 1994.

4. Lect Notes Comput Sci;M. Carlsson,1997

5. F.R. du Verdier. Résolution de problèmes d’aménagement spatial fondée sur la satisfaction de contraintes. Validation sur l’implantation d’équipements électroniques hyperfréquences. PhD thesis, Université Claude Bernard-Lyon I, July 1992.

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

1. Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints;Lecture Notes in Computer Science;2016

2. Rectangle Placement for VLSI Testing;Integration of AI and OR Techniques in Constraint Programming;2015

3. Synchronized sweep algorithms for scalable scheduling constraints;Constraints;2014-10-31

4. Multi-site scheduling under production and transportation constraints;International Journal of Computer Integrated Manufacturing;2013-03

5. A New Graph-Theoretical Model for the Guillotine-Cutting Problem;INFORMS Journal on Computing;2013-02