Kübra Taninmis

According to our database, Kübra Taninmis authored at least 10 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.

Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis

Math. Program., July, 2024

Competing for the most profitable tour: The orienteering interdiction game.

Eduardo Álvarez-Miranda, Markus Sinnl, Kübra Taninmis

CoRR, 2024

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks.

Kübra Taninmis, Necati Aras, Evren Güney, Markus Sinnl

Comput. Oper. Res., 2024

2023

An exact method for binary fortification games.

Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis

Eur. J. Oper. Res., June, 2023

2022

A Branch-and-Cut Algorithm for Submodular Interdiction Games.

Kübra Taninmis, Markus Sinnl

INFORMS J. Comput., 2022

Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks.

Kübra Taninmis, Necati Aras, I. Kuban Altinel

Eur. J. Oper. Res., 2022

SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs.

Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021

An Exact Method for Fortification Games.

Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis

CoRR, 2021

2020

Minimizing the misinformation spread in social networks.

Kübra Taninmis, Necati Aras, I. Kuban Altinel, Evren Güney

IISE Trans., 2020

2019

Influence maximization with deactivation in social networks.

Kübra Taninmis, Necati Aras, I. Kuban Altinel

Eur. J. Oper. Res., 2019