We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
Antoine Jouglet, David Savourey, Jacques Carlier, ...
Abstract Level set methods have been used in a great number of applications in R2 and R3 and it is natural to consider extending some of these methods to problems defined on surfac...
Abstract. We introduce a new technique for the error analysis of hybridizable discontinuous Galerkin (HDG) methods. The technique relies on the use of a new projection whose design...