One-level reformulation of the bilevel Knapsack problem using dynamic programming

DOI10.1016/J.DISOPT.2012.09.001MaRDI QIDQ1941532zbMATH OpenOpenAlexFDO

Authors L. Brotcorne, Saïd Hanafi, 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

zbMATH Keywords

bilevel programmingbranch-and-bounddynamic programmingKnapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• A dynamic programming algorithm for the bilevel Knapsack problem
• An exact algorithm for bilevel 0-1 knapsack problems
• On exact solution approaches for bilevel quadratic 0-1 knapsack problem
• Exact solution approach for a class of nonlinear bilevel knapsack problems
• Bilevel programming with knapsack constraints

Cited in

(26)

• A single-level reformulation of mixed integer bilevel programming problems
• An exact algorithm for bilevel 0-1 knapsack 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
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
• A polynomial algorithm for a continuous bilevel knapsack problem
• A faster algorithm for the continuous bilevel knapsack problem
• An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming 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
• Multilevel approaches for the critical node problem
• Bilevel optimization: theory, algorithms, applications and a bibliography
• A Branch-and-Cut Algorithm for Submodular Interdiction Games
• Solving stochastic and bilevel mixed-integer programs via a generalized value function
• Solution techniques for bi-level knapsack problems
• On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
• An exact approach for the Stackelberg knapsack problem with weight selection
• Deep learning based high accuracy heuristic approach for knapsack interdiction problem
• Bilevel optimization approach for fuel treatment planning
• Existence of solutions in bilevel stochastic linear programming with integer variables in the lower level problem
• On exact solution approaches for bilevel quadratic 0-1 knapsack problem
• A dynamic programming algorithm for the bilevel Knapsack problem

This page was built for publication: One-level reformulation of the bilevel Knapsack problem using dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1941532)