1 citations · 1 across the 6 of their papers we have counts for
8 papers · 1 filter
Mixed-integer linear programming approaches for nested -center problems with absolute and relative regret objectives
Christof Brandstetter, Markus Sinnl
We introduce the nested -center problem, which is a multi-period variant of the well-known -center problem. The use of the nesting concept allows to obtain solutions, which a…
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…
An iterative exact algorithm for the weighted fair sequences problem
Markus Sinnl
In this work, we present a new iterative exact solution algorithm for the weighted fair sequences problem, which is a recently introduced NP-hard sequencing problem with applicatio…
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…
Exact and heuristic algorithms for the weighted total domination problem
Eduardo Álvarez-Miranda, Markus Sinnl
Dominating set problems are among the most important class of combinatorial problems in graph optimization, from a theoretical as well as from a practical point of view. In this pa…
An exact solution framework for the multiple gradual cover location problem
Eduardo Álvarez-Miranda, Markus Sinnl
Facility and covering location models are key elements in many decision aid tools in logistics, supply chain design, telecommunications, public infrastructure planning, and many ot…