Journal
OPERATIONS RESEARCH LETTERS
Volume 46, Issue 2, Pages 185-188Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2017.12.009
Keywords
Bilevel programming; Continuous knapsack problem; Polynomial time
Categories
Funding
- ERDF European Regional Development Fund through the Operational Programme for Competitiveness and Internationalization-COMPETE Programme [POCI-01-0145-FEDER-006961]
- FCT (Portuguese Foundation for Science and Technology) [UID/EEA/50014/2013, PTDC/IIMGES/2830/ 2014]
- NSERC [A5789]
Ask authors/readers for more resources
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)). (C) 2018 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
