16 citations · 54 across the 22 of their papers we have counts for
9 papers · 1 filter
An Exact Method for Fortification Games
Markus Leitner, Ivana Ljubić, Michele Monaci +2
A fortification game (FG) is a three-level, two-player Stackelberg game, also known as defender-attacker-defender game, in which at the uppermost level, the defender selects some a…
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
Elisabeth Gaar, Jon Lee, Ivana Ljubić +2
We study a class of bilevel integer programs with second-order cone constraints at the upper level and a convex quadratic objective and linear constraints at the lower level. We de…
On Solving the Minimum Common String Partition Problem by Decision Diagrams
Miloš Chromý, Markus Sinnl
In the Minimum Common String Partition Problem (MCSP), we are given two strings on input, and we want to partition both into the same collection of substrings, minimizing the numbe…
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 scaleable projection-based branch-and-cut algorithm for the -center problem
Elisabeth Gaar, Markus Sinnl
The -center problem (pCP) is a fundamental problem in location science, where we are given customer demand points and possible facility locations, and we want to choose of t…
Experiments with graph convolutional networks for solving the vertex -center problem
Elisabeth Gaar, Markus Sinnl
In the last few years, graph convolutional networks (GCN) have become a popular research direction in the machine learning community to tackle NP-hard combinatorial optimization pr…
A branch-and-cut algorithm for submodular interdiction games
Kübra Tanınmış, Markus Sinnl
Many relevant applications from diverse areas such as marketing, wildlife conservation, or defending critical infrastructure can be modeled as interdiction games. In this work, we…
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…
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…