One-level reformulation of the bilevel Knapsack problem using dynamic programming
From MaRDI portal
Publication:1941532
DOI10.1016/j.disopt.2012.09.001zbMath1258.90058OpenAlexW2010701510MaRDI QIDQ1941532
Saïd Hanafi, Luce Brotcorne, Raïd Mansi
Publication date: 13 March 2013
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2012.09.001
Related Items (20)
On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Bilevel Knapsack with Interdiction Constraints ⋮ A class of algorithms for mixed-integer bilevel min-max optimization ⋮ Bilevel “Defender–Attacker” Model with Multiple Attack Scenarios ⋮ SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs ⋮ A faster algorithm for the continuous bilevel knapsack problem ⋮ A polynomial algorithm for a continuous bilevel knapsack problem ⋮ Solution techniques for bi-level knapsack problems ⋮ An exact approach for the bilevel knapsack problem with interdiction constraints and extensions ⋮ An exact algorithm for bilevel 0-1 knapsack problems ⋮ Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function ⋮ A single-level reformulation of mixed integer bilevel programming problems ⋮ Designing coalition-based fair and stable pricing mechanisms under private information on consumers' reservation prices ⋮ Exact solution approach for a class of nonlinear bilevel knapsack problems ⋮ On the Stackelberg knapsack game ⋮ An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems ⋮ Multilevel Approaches for the Critical Node Problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
This page was built for publication: One-level reformulation of the bilevel Knapsack problem using dynamic programming
