Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
Nikita Boyko, Timofey Turko, Vladimir Boginski, Da...
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consist...
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...