Journal
OPERATIONS RESEARCH LETTERS
Volume 48, Issue 6, Pages 784-786Publisher
ELSEVIER
DOI: 10.1016/j.orl.2020.09.007
Keywords
Bilevel programming; Fast algorithm; Knapsack problem
Categories
Funding
- DFG, Germany [RTG 2236]
Ask authors/readers for more resources
We construct a fast algorithm with time complexity O(n log n) for a continuous bilevel knapsack problem with interdiction constraints for n items. This improves on a recent algorithm from the literature with quadratic time complexity O(n2). (c) 2020 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
