3 search results - page 1 / 1 » O(n log n) Filtering Algorithms for Unary Resource Constrain... |
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another t...
CP
2004
Springer
13 years 8 months ago
2004
Springer
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
CPAIOR
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...