CPAIOR
2009
Springer
14 years 6 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 ...
CPAIOR
2009
Springer
14 years 6 months ago
2009
Springer
CPAIOR
2009
Springer
14 years 6 months ago
2009
Springer
CPAIOR
2009
Springer
14 years 6 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
CPAIOR
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
CPAIOR
2009
Springer
14 years 6 months ago
2009
Springer
CPAIOR
2009
Springer
14 years 6 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
CPAIOR
2009
Springer
14 years 6 months ago
2009
Springer
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
CPAIOR
2009
Springer
14 years 6 months ago
2009
Springer
Abstract: This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-recta...
CPAIOR
2009
Springer
14 years 6 months ago
2009
Springer
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...