At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
Louis-Martin Rousseau, Gilles Pesant, Michel Gendr...
Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model...
Abstract--This paper presents a relational positioning methodology that allows to restrict totally or partially the movements of an object by specifying its allowed positions in te...
A problem of joint optimal bandwidth and power allocation in cognitive networks under fading channels is considered. It is assumed that multiple secondary users (SUs) share the sp...
Xiaowen Gong, Sergiy A. Vorobyov, Chintha Tellambu...