CPAIOR
2009
Springer
13 years 5 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...
CPAIOR
2009
Springer
13 years 9 months ago
2009
Springer
CPAIOR
2009
Springer
13 years 9 months ago
2009
Springer
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint pro...
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems...
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...