16 citations · 18 across the 4 of their papers we have counts for
7 papers
Competing for the most profitable tour: The orienteering interdiction game
Eduardo Álvarez-Miranda, Markus Sinnl, Kübra Tanınmış
The orienteering problem is a well-studied and fundamental problem in transportation science. In the problem, we are given a graph with prizes on the nodes and lengths on the edges…
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
Kübra Tanınmış, Necati Aras, Evren Güney +1
The COVID-19 pandemic has been a recent example for the spread of a harmful contagion in large populations. Moreover, the spread of harmful contagions is not only restricted to an…
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
Elisabeth Gaar, Jon Lee, Ivana Ljubić +2
We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-lev…
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…
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…