Talk ·
Propagation Algorithms for the Minimum-Distance Constraint over Selected Points
Direct propagation algorithms for selecting well-spaced points, including pairwise, global, advisor-backed, and matching-based variants.
- Speaker
- Mikael Zayenz Lagerkvist
- Occasion
- The 25th International Workshop on Constraint Modelling and Reformulation (ModRef 2026)Lisbon, Portugal
Interactive presentation
Slides
Click the presentation, then use the arrow keys, Page Up/Page Down, or Space to move through it.
The talk compares direct Gecode implementations of the minimum-distance constraint with its usual quadratic decomposition. It follows the design from small pairwise propagators through advisors and a conflict-graph matching bound, then compares their behaviour on p-dispersion instances.