The bilevel knapsack problem with stochastic right-hand sides

DOI10.1016/J.ORL.2010.04.005MaRDI QIDQ991476zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

bilevel programmingvalue functionsstochastic integer programming

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 4053339 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2246593 (Why is no real title available?)
• A dynamic programming algorithm for the bilevel Knapsack problem
• 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
• An overview of bilevel optimization
• Bilevel programming with knapsack constraints
• Discrete linear bilevel programming problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Foundations of bilevel programming
• Multilevel optimization: algorithms and applications
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Recent trends in modeling of deteriorating inventory
• Stochastic programming with integer variables
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
• Weak via strong Stackelberg problem: New results

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
• On bilevel optimization with inexact follower
• The stochastic bilevel selection problem
• 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

Describes a project that uses

Uses Software

• Knapsack
• CPLEX

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)