3 papers
math.OC2020
Fractional 0-1 programming and submodularity
Shaoning Han, Andres Gomez, Oleg A Prokopyev
In this note we study multiple-ratio fractional 0--1 programs, a broad class of NP-hard combinatorial optimization problems. In particular, under some relatively mild assumptions w…
math.OC2019
An approach to the distributionally robust shortest path problem
Sergey S. Ketkov, Oleg A. Prokopyev, Evgenii P. Burashnikov
In this study we consider the shortest path problem, where the arc costs are subject to distributional uncertainty. Basically, the decision-maker attempts to minimize her worst-cas…
cs.GT2018
On Greedy and Strategic Evaders in Sequential Interdiction Settings with Incomplete Information
Sergey S. Ketkov, Oleg A. Prokopyev
We consider a class of sequential network interdiction problem settings where the interdictor has incomplete initial information about the network while the evader has complete kno…