Sweep synchronization as a global propagation mechanism

DOI10.1016/j.cor.2005.01.013zbMath1113.68097OpenAlexW1976740355MaRDI QIDQ2489125

Mats Carlsson, Sven Thiel, Nicolas Beldiceanu

Publication date: 16 May 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-22036

zbMATH Keywords

TimetablingFiltering algorithmGlobal constraintSweep

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Optimal rectangle packing ⋮ A new constraint programming approach for the orthogonal packing problem ⋮ CROSS cyclic resource-constrained scheduling solver ⋮ Multi-dimensional bin packing problems with guillotine constraints ⋮ Consecutive ones matrices for multi-dimensional orthogonal packing problems ⋮ Synchronized sweep algorithms for scalable scheduling constraints

Uses Software

• SICStus

Cites Work

• Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• Constraint programming for combinatorial search problems
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sweep synchronization as a global propagation mechanism