28 citations · 32 across the 3 of their papers we have counts for
4 papers
Fair integer programming under dichotomous and cardinal preferences
Tom Demeulemeester, Dries Goossens, Ben Hermans +1
One cannot make truly fair decisions using integer linear programs unless one controls the selection probabilities of the (possibly many) optimal solutions. For this purpose, we pr…
A pessimist's approach to one-sided matching
Tom Demeulemeester, Dries Goossens, Ben Hermans +1
Inspired by real-world applications such as the assignment of pupils to schools or the allocation of social housing, the one-sided matching problem studies how a set of agents can…
QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
Ben Hermans, Andreas Themelis, Panagiotis Patrinos
We propose QPALM, a nonconvex quadratic programming (QP) solver based on the proximal augmented Lagrangian method. This method solves a sequence of inner subproblems which can be e…
A new envelope function for nonsmooth DC optimization
Andreas Themelis, Ben Hermans, Panagiotis Patrinos
Difference-of-convex (DC) optimization problems are shown to be equivalent to the minimization of a Lipschitz-differentiable "envelope". A gradient method on this surrogate functio…