The stochastic bilevel selection problem

DOI10.1007/978-3-031-24907-5_7MaRDI QIDQ6606520zbMATH OpenFDO

Authors Jannik Irmai

Publication date 17 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-24907-5_7

zbMATH Keywords

bilevel optimizationcomplexitystochastic optimization

Mathematics Subject Classification ID

Stochastic programming (90C15)

Recommendations

• The stochastic bilevel continuous knapsack problem with uncertain follower's objective
• The bilevel knapsack problem with stochastic right-hand sides
• Improved approximation algorithms for a bilevel knapsack problem
• Improved approximation algorithms for a bilevel knapsack problem
• A Stackelberg knapsack game with weight control

Cites work

• A study on the computational complexity of the bilevel knapsack problem
• Bilevel programming problems. Theory, algorithms and applications to energy networks
• Discrete-variable extremum problems
• On the complexity of robust bilevel optimization with uncertain follower's objective
• The bilevel knapsack problem with stochastic right-hand sides
• The stochastic bilevel continuous knapsack problem with uncertain follower's objective

This page was built for publication: The stochastic bilevel selection problem

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