Constraint Programming (CP) has been successful in a number of combinatorial search and discrete optimisation problems. Yet other more traditional approaches, such as Integer Programming (IP), can ...
N. Rubin, Bright, C. , Cheung, K. K. H. , and Stevens, B. , “Improving Integer and Constraint Programming for Graeco-Latin Squares”, in 33rd IEEE International ...
Mathematical programming with vanishing constraints (MPVC) represents a challenging class of optimisation problems where certain constraints become inactive—or “vanish”—depending on specific ...
Abstract: This paper defines constraint search trees, a general tree data structure for storing and accessing items with constraints as keys. Constraint search trees can mimic binary search trees, ...
Abstract: In this paper, we propose a generalization of the processing of Boolean constraints in CLP by introducing a new type of constraint, the pseudo-equality, which can be used to partially ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback