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. We follow recent work by Schoenemann et al. [25] for expressing curvature regularity as a linear program. While the original formulation focused on binary segmentation, w...
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Abstract. We analyze the so-called the minimal dissipation local discontinuous Galerkin method for convection-diffusion or diffusion problems. The distinctive feature of this met...
The Green function of the Poisson equation in two dimensions is not contained in the Sobolev space H1(Ω) such that finite element error estimates for the discretization of a prob...
Thomas Apel, Olaf Benedix, Dieter Sirch, Boris Vex...