research
∙
03/01/2023
A linear time algorithm for linearizing quadratic and higher-order shortest path problems
An instance of the NP-hard Quadratic Shortest Path Problem (QSPP) is cal...
share
research
∙
09/02/2022
On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy
We study the computational complexity of multi-stage robust optimization...
research
∙
06/22/2022
Dispersing Obnoxious Facilities on Graphs by Rounding Distances
We continue the study of δ-dispersion, a continuous facility location pr...
research
∙
02/09/2022
Allocation of Indivisible Items with Individual Preference Graphs
This paper studies the allocation of indivisible items to agents, when e...
research
∙
11/18/2021
On the Recoverable Traveling Salesman Problem
In this paper we consider the Recoverable Traveling Salesman Problem (TS...
research
∙
07/30/2021
Assistance and Interdiction Problems on Interval Graphs
We introduce a novel framework of graph modifications specific to interv...
research
∙
04/07/2021
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty
We consider two-stage robust optimization problems, which can be seen as...
research
∙
10/22/2020
An Investigation of the Recoverable Robust Assignment Problem
We investigate the so-called recoverable robust assignment problem on ba...
research
∙
08/28/2020
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty
Recoverable robust optimization is a multi-stage approach, where it is p...
research
∙
07/10/2019
Matroid Bases with Cardinality Constraints on the Intersection
Given two matroids M_1 = (E, B_1) and M_2 = (E, B_2) on a common ground ...
research
∙
11/21/2018
Dispersing obnoxious facilities on a graph
We study a continuous facility location problem on a graph where all edg...
research
∙
02/23/2018
