The Multi-Inter-Distance Constraint
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 629-633.
Abstract
We introduce the MULTI-INTER-DISTANCE constraint that ensures no more than m variables are assigned to values lying in a window of p consecutive values. This constraint is useful for modeling scheduling problems where tasks of processing time p compete for m identical resources. We present a propagator that achieves bounds consistency in cubic time. Experiments show that this new constraint offers a much stronger filtering than an edge-finder and that it allows to solve larger instances of the runway scheduling problem.
@inproceedings{ijcai2011p112,
title = {The Multi-Inter-Distance Constraint},
author = {Ouellet, Pierre and Quimper, Claude-Guy},
booktitle = {Proceedings of the Twenty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-11}},
publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
editor = {Toby Walsh},
pages = {629--633},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-112},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-112},
}
TY - CPAPER TI - The Multi-Inter-Distance Constraint AU - Ouellet, Pierre AU - Quimper, Claude-Guy T2 - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11 PB - AAAI Press/International Joint Conferences on Artificial Intelligence PY - 2011 SP - 629 EP - 633 DO - 10.5591/978-1-57735-516-8/IJCAI11-112 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-112 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
