The bilevel knapsack problem with stochastic right-hand sides

DOI10.1016/j.orl.2010.04.005zbMath1193.90180OpenAlexW2014906945MaRDI QIDQ991476

Oleg A. Prokopyev, Osman Y. Özaltın, Andrew J. Schaefer

Publication date: 7 September 2010

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

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

zbMATH Keywords

stochastic integer programmingvalue functionsbilevel programming

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (13)

On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ On a stochastic bilevel programming problem ⋮ The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective ⋮ A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs ⋮ Bilevel Integer Programs with Stochastic Right-Hand Sides ⋮ A survey on bilevel optimization under uncertainty ⋮ On Bilevel Optimization with Inexact Follower ⋮ Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function ⋮ Feature selection for classification models via bilevel optimization ⋮ Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control ⋮ A mixed-integer bilevel programming approach for a competitive prioritized set covering problem ⋮ Exact solution approach for a class of nonlinear bilevel knapsack problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• CPLEX
• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• A dynamic programming algorithm for the bilevel Knapsack problem
• Multilevel optimization: algorithms and applications
• Stochastic programming with integer variables
• Foundations of bilevel programming
• Weak via strong Stackelberg problem: New results
• A finite branch-and-bound algorithm for two-stage stochastic integer programs
• Discrete linear bilevel programming problem
• An algorithm for the construction of convex hulls in simple integer recourse programming
• An overview of bilevel optimization
• Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Recent trends in modeling of deteriorating inventory
• Bilevel programming with knapsack constraints

This page was built for publication: The bilevel knapsack problem with stochastic right-hand sides