A faster algorithm for the continuous bilevel knapsack problem

DOI10.1016/j.orl.2020.09.007OpenAlexW3088155299MaRDI QIDQ2661565

Dennis Fischer, Gerhard J. Woeginger

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2020.09.007

zbMATH Keywords

knapsack problemfast algorithmbilevel programming

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective ⋮ The subset sum game revisited

Cites Work

• Unnamed Item
• Unnamed Item
• A dynamic programming algorithm for the bilevel Knapsack problem
• One-level reformulation of the bilevel Knapsack problem using dynamic programming
• A polynomial algorithm for a continuous bilevel knapsack problem
• Bilevel Knapsack with Interdiction Constraints
• A Study on the Computational Complexity of the Bilevel Knapsack Problem
• Bilevel programming with knapsack constraints