activity
20182023
most citedBranch-and-bound for bi-objective integer programming

46 citations · 87 across the 9 of their papers we have counts for

collaborators
Showing math.OCShow all

5 papers · 1 filter

math.OC2022★ 1 cited

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…

math.OC2022★ 3 cited

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…

math.OC2021★ 2 cited

An outer approximation algorithm for multi-objective mixed-integer linear and non-linear programming

Fritz Bökler, Sophie N. Parragh, Markus Sinnl +1

In this paper, we present the first outer approximation algorithm for multi-objective mixed-integer linear programming problems with any number of objectives. The algorithm also wo…

math.OC2021

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…

math.OC2020

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…