This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This nonlocal graph allows to adapt the penalization to t...
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...
George Boukeas, Panagiotis Stamatopoulos, Constant...
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...