1 paper
Amaury Guichard, Laurent Michel, Hélène Verhaeghe +1
Achieving bound consistency for the no-overlap constraint is known to be NP-complete. Therefore, several polynomial-time tightening techniques, such as edge finding, not-first-not-…