Dynamic optimization of chemotherapy outpatient scheduling with uncertainty
Chemotherapy outpatient scheduling is a complex, dynamic, uncertain problem.
Chemotherapy centres are facing increasing demands and they need to increase their …
Chemotherapy centres are facing increasing demands and they need to increase their …
Iterative plan construction for the workflow satisfiability problem
The Workflow Satisfiability Problem (WSP) is a problem of practical interest that arises
whenever tasks need to be performed by authorized users, subject to constraints defined by …
whenever tasks need to be performed by authorized users, subject to constraints defined by …
Constraint programming-based column generation
S Gualandi, F Malucelli - Annals of Operations Research, 2013 - Springer
This paper surveys recent applications and advances of the Constraint Programming-based
Column Generation framework, where the master subproblem is solved by traditional OR …
Column Generation framework, where the master subproblem is solved by traditional OR …
Constraint programming-based column generation
S Gualandi, F Malucelli - 4OR, 2009 - Springer
This paper surveys recent applications and advances of the constraint programming-based
column generation framework, where the master subproblem is solved by traditional OR …
column generation framework, where the master subproblem is solved by traditional OR …
Constraint processing
R Barták - Encyclopedia of Artificial Intelligence, 2009 - igi-global.com
Constraints appear in many areas of human endeavour starting from puzzles like
crosswords (the words can only overlap at the same letter) and recently popular Sudoku (no …
crosswords (the words can only overlap at the same letter) and recently popular Sudoku (no …
An O (nlog n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization
This paper gives an O (nlog n) bound-consistency filtering algorithm for the conjunction
alldifferent (V 0, V 1,…, V n− 1)∧ f (V 0)⌖ f (V 1)⌖…⌖ f (V n− 1)≤ cst,(V 0, V 1,…, V n− 1 …
alldifferent (V 0, V 1,…, V n− 1)∧ f (V 0)⌖ f (V 1)⌖…⌖ f (V n− 1)≤ cst,(V 0, V 1,…, V n− 1 …
[图书][B] Dynamic optimization addressing chemotherapy outpatient scheduling
S Hahn-Goldberg - 2014 - search.proquest.com
Chemotherapy outpatient scheduling is a complex problem containing uncertainty.
Chemotherapy centres are facing increasing demands and they need to increase their …
Chemotherapy centres are facing increasing demands and they need to increase their …
History of constraint programming
R Barták - Wiley Encyclopedia of Operations Research and …, 2010 - Wiley Online Library
Constraint programming is a technology for solving combinatorial optimization problems. It
appeared in the 1960s in systems such as Sketchpad, and core ideas such as arc and path …
appeared in the 1960s in systems such as Sketchpad, and core ideas such as arc and path …
Sequential precede chain for value symmetry elimination
G Gange, PJ Stuckey - International Conference on Principles and Practice …, 2018 - Springer
The main global constraint used for removing value symmetries is the value-precede-chain
constraint which forces the first occurences of values in an ordered list to be appear in order …
constraint which forces the first occurences of values in an ordered list to be appear in order …
Puzzle—Solving the n-Fractions Puzzle as a Constraint Programming Problem
A Malapert, J Provillard - INFORMS Transactions on …, 2018 - pubsonline.informs.org
The aim in solving puzzles is to find the solution using several clues and restrictions. In this
paper, we solve a numerical puzzle, the n-fractions puzzle, by constraint programming. The …
paper, we solve a numerical puzzle, the n-fractions puzzle, by constraint programming. The …