Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
Olav Geil, Carlos Munuera, Diego Ruano, Fernando T...
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
Christian Bessiere, George Katsirelos, Nina Narody...
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...