The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
From MaRDI portal
Publication:2154452
DOI10.1007/s10898-021-01117-9zbMath1495.90147arXiv1903.02810OpenAlexW4205717391MaRDI QIDQ2154452
Dorothee Henke, Christoph Buchheim
Publication date: 19 July 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.02810
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)
Related Items (5)
The stochastic bilevel continuous knapsack problem with uncertain follower's objective ⋮ Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem ⋮ A survey on bilevel optimization under uncertainty ⋮ On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level ⋮ Shortest path network interdiction with asymmetric uncertainty
Cites Work
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- Robust combinatorial optimization under convex and discrete cost uncertainty
- A dynamic programming algorithm for the bilevel Knapsack problem
- The bilevel knapsack problem with stochastic right-hand sides
- Robust discrete optimization and its applications
- On the approximability of average completion time scheduling under precedence constraints.
- Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function
- On a class of bilevel linear mixed-integer programs in adversarial settings
- An exact algorithm for bilevel 0-1 knapsack problems
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- Complexity of near-optimal robust versions of multilevel optimization problems
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
- A polynomial algorithm for a continuous bilevel knapsack problem
- An overview of bilevel optimization
- A faster algorithm for the continuous bilevel knapsack problem
- Existence, Uniqueness, and Computation of Robust Nash Equilibria in a Class of Multi-Leader-Follower Games
- A Study on the Computational Complexity of the Bilevel Knapsack Problem
- The Price of Robustness
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel Programming Problems
- Pessimistic Bilevel Optimization
- Discrete-Variable Extremum Problems
- Bilevel programming with knapsack constraints
This page was built for publication: The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
