Article ID Journal Published Year Pages File Type
7543837 Operations Research Letters 2018 10 Pages PDF
Abstract
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(n2).
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A polynomial algorithm for a continuous bilevel knapsack problem
Authors
, , ,