3 citations · 4 across the 4 of their papers we have counts for
6 papers
A matheuristic for tri-objective binary integer programming
Duleabom An, Sophie N. Parragh, Markus Sinnl +1
Many real-world optimisation problems involve multiple objectives. When considered concurrently, they give rise to a set of optimal trade-off solutions, also known as efficient sol…
A lexicographic maximin approach to the selective assessment routing problem
Mohammadmehdi Hakimifar, Vera Hemmelmayr, Fabien Tricoire
Max-min approaches have been widely applied to address equity as an essential consideration in humanitarian operations. These approaches, however, have a significant drawback of be…
A LP relaxation based matheuristic for multi-objective integer programming
Duleabom An, Sophie N. Parragh, Markus Sinnl +1
Motivated by their success in the single-objective domain, we propose a very simple linear programming-based matheuristic for tri-objective binary integer programming. To tackle th…
A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem
Sophie N. Parragh, Fabien Tricoire, Walter Gutjahr
In many real-world optimization problems, more than one objective plays a role and input parameters are subject to uncertainty. In this paper, motivated by applications in disaster…
Branch-and-bound for bi-objective integer programming
Sophie N. Parragh, Fabien Tricoire
In bi-objective integer optimization the optimal result corresponds to a set of non-dominated solutions. We propose a generic bi-objective branch-and-bound algorithm that uses a pr…
A Local-Search Based Heuristic for the Unrestricted Block Relocation Problem
Dominique Feillet, Sophie N. Parragh, Fabien Tricoire
The unrestricted block relocation problem is an important optimization problem encountered at terminals, where containers are stored in stacks. It consists in determining the minim…