This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
In this paper, we describe a technique to temporally sort a collection of photos that span many years. By reasoning about persistence of visible structures, we show how this sorti...
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...