The bilevel knapsack problem with stochastic right-hand sides
From MaRDI portal
Publication:991476
DOI10.1016/J.ORL.2010.04.005zbMATH Open1193.90180OpenAlexW2014906945MaRDI QIDQ991476FDOQ991476
Authors: Osman Y. Özaltın, Oleg A. Prokopyev, 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
Recommendations
- The stochastic bilevel continuous knapsack problem with uncertain follower's objective
- On a stochastic bilevel programming problem
- Bilevel programming with knapsack constraints
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- A dynamic programming algorithm for the bilevel Knapsack problem
Cites Work
- Foundations of bilevel programming
- Weak via strong Stackelberg problem: New results
- An overview of bilevel optimization
- Title not available (Why is that?)
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Recent trends in modeling of deteriorating inventory
- Multilevel optimization: algorithms and applications
- Stochastic programming with integer variables
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- An algorithm for the construction of convex hulls in simple integer recourse programming
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- A dynamic programming algorithm for the bilevel Knapsack problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Discrete linear bilevel programming problem
- Bilevel programming with knapsack constraints
- Title not available (Why is that?)
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- Title not available (Why is that?)
Cited In (18)
- Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- Feature selection for classification models via bilevel optimization
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- A survey on bilevel optimization under uncertainty
- The stochastic bilevel selection problem
- On bilevel optimization with inexact follower
- On a stochastic bilevel programming problem
- A dynamic programming algorithm for the bilevel Knapsack problem
- A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
- The stochastic bilevel continuous knapsack problem with uncertain follower's objective
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Bilevel programming with knapsack constraints
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Decision rule bounds for two-stage stochastic bilevel programs
Uses Software
This page was built for publication: The bilevel knapsack problem with stochastic right-hand sides
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991476)
