Sweep synchronization as a global propagation mechanism

Computers and Operations Research

Volumn 33, Issue 10, 2006, Pages 2835-2851

  Beldiceanu, Nicolas ^a   Carlsson, Mats ^a   Thiel, Sven ^b  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Filtering algorithm; Global constraint; Sweep; Timetabling

Indexed keywords

COMPUTER PROGRAMMING; PROBLEM SOLVING; SYNCHRONIZATION;

FILTERING ALGORITHM; GLOBAL CONSTRAINT; SWEEP; TIMETABLING;

ALGORITHMS;

EID: 32044449835     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.01.013     Document Type: Article

References (11)

1. Van Hentenryck P. Constraint programming for combinatorial search problems. Constraints, vol. 2(1). Dordrecht: Kluwer Academic Publishers, 1997, p. 99-101.
2. Beldiceanu N, Carlsson M. Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh T, editor. Proceedings of the seventh CP, vol. 2239 of Lecture Notes in Computer Science. Berlin: Springer; 2001, p. 377-91.
3. de Berg M, van Kreveld M, Overmars M, Schwarzkopf O. Computational geometry - algorithms and applications. Berlin: Springer; 1997.
4. Régin J-C. A filtering algorithm for constraints of difference in CSPs. Proceedings of the 12th national conference on artificial intelligence (AAAI-94), vol. 1. 1994. p. 362-67.
5. L.R. Ford, and D.R. Fulkerson Flows in networks 1963 Princeton University Press Princeton, NJ
6. K. Mehlhorn, and S. Näher LEDA a platform for combinatorial and geometric computing 1999 Cambridge University Press Cambridge
7. J.E. Hopcroft, and R.M. Karp An n 5 / 2 algorithm for maximum matchings in bipartite graphs SIAM Journal on Computing 2 4 1973 225 231
8. H. Alt, N. Blum, K. Mehlhorn, and M. Paul Computing a maximum cardinality matching in a bipartite graph in time O (n 1.5 (m / log n ) 1 / 2 ) Information Processing Letters 37 4 1991 237 240
9. Carlsson M. et al. SICStus Prolog User's Manual. Swedish Institute of Computer Science, 3.10 edition (2003). http://www.sics.se/sicstus/.
10. J. Carlier, and E. Pinson A practical use of Jackson's preemptive schedule for solving the job-shop problem Annals of Operations Research 26 1990 269 287
11. Régin J-C, Generalized arc consistency for global cardinality constraint. Proceedings of the 14th national conference on artificial intelligence (AAAI-96). 1996. p. 209-15.