Authors
Margarida Carvalho, Andrea Lodi, Patrice Marcotte
Publication date
2018/3/1
Journal
Operations Research Letters
Volume
46
Issue
2
Pages
185-188
Publisher
North-Holland
Description
In this note, we analyze a bilevel interdiction problem, where the follower’s program is a parametrized continuous knapsack. Based on the structure of the problem and an inverse optimization strategy, we propose for its solution an algorithm with worst-case complexity O (n 2).
Scholar articles
M Carvalho, A Lodi, P Marcotte - Operations Research Letters, 2018