activity
20202026
most citedAn Exact Method for Fortification Games

16 citations · 39 across the 7 of their papers we have counts for

collaborators

8 papers

math.OC2026

On solving integer bilevel optimization problems with a non-convex quadratic follower objective function using disjunctive cuts

Kübra Tanınmış, Elisabeth Gaar, Jon Lee +2

In this work, we study bilevel optimization problems where all variables are integer, all constraints and the leader objective function are linear, and the follower objective funct…

math.OC2024

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…

math.OC2023★ 1 cited

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…

math.OC2022★ 1 cited

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…

math.OC2021★ 16 cited

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…

math.OC2021★ 2 cited

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…

math.OC2021★ 6 cited

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…

math.OC2020★ 13 cited

Improved x-space Algorithm for Min-Max Bilevel Integer Programming with an Application to Misinformation Spread in Social Networks

Kübra Tanınmış, Necati Aras, İ. Kuban Altınel

In this work we propose an improvement of the -space algorithm developed for solving a class of min--max bilevel optimization problems (Tang Y., Richard J.P.P., Smith J.C. (2016…