On Bilevel Optimization with Inexact Follower
From MaRDI portal
Publication:5120277
DOI10.1287/deca.2019.0392OpenAlexW3006959147MaRDI QIDQ5120277
M. Hosein Zare, Oleg A. Prokopyev, Denis Sauré
Publication date: 9 September 2020
Published in: Decision Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/deca.2019.0392
Related Items (6)
Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem ⋮ A survey on bilevel optimization under uncertainty ⋮ Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds ⋮ The multilevel facility location and pricing problems: the computational complexity and the stability analysis ⋮ Complexity of near-optimal robust versions of multilevel optimization problems ⋮ On the Stackelberg knapsack game
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hybrid defensive resource allocations in the face of partially strategic attackers in a sequential defender-attacker game
- On the value of exposure and secrecy of defense system: first-mover advantage vs. robustness
- A class of algorithms for mixed-integer bilevel min-max optimization
- Enhanced exact algorithms for discrete bilevel linear problems
- Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting
- A dynamic programming algorithm for the bilevel Knapsack problem
- Linear bilevel programming with upper level constraints depending on the lower level solution
- The bilevel knapsack problem with stochastic right-hand sides
- Existence of optimal solutions to mathematical programs with equilibrium constraints
- Dynamic programming algorithms for the zero-one knapsack problem
- An algorithm for the solution of the 0-1 knapsack problem
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Practical bilevel optimization. Algorithms and applications
- Links between linear bilevel and mixed 0-1 programming problems
- Robust discrete optimization and network flows
- A bilevel programming approach to determining tax credits for biofuel production
- A partial cooperation model for non-unique linear two-level decision problems
- Foundations of bilevel programming
- A note on linearized reformulations for a class of bilevel linear integer problems
- On a class of bilevel linear mixed-integer programs in adversarial settings
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- Deterministic network interdiction
- A simple recipe for concise mixed 0-1 linearizations
- Discrete linear bilevel programming problem
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- A cutting plane approach for bilevel hazardous material transport network design
- Survivable network design under optimal and heuristic interdiction scenarios
- Disjunctive cuts for continuous linear bilevel programming
- New branch-and-Cut algorithm for bilevel linear programming
- An overview of bilevel optimization
- A new method for strong-weak linear bilevel programming problem
- Resource Allocation for Homeland Defense: Dealing with the Team Effect
- Simple Models for Multiattribute Choice with Many Alternatives: When It Does and Does Not Pay to Face Trade-offs with Binary Attributes
- Bilevel Knapsack with Interdiction Constraints
- A Study on the Computational Complexity of the Bilevel Knapsack Problem
- The Price of Robustness
- A New Algorithm for the 0-1 Knapsack Problem
- An Algorithm for Large Zero-One Knapsack Problems
- Computing Partitions with Applications to the Knapsack Problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Sequential Shortest Path Interdiction with Incomplete Information
- Modeling a Multitarget Attacker–Defender Game with Budget Constraints
- A Complexity and Approximability Study of the Bilevel Knapsack Problem
- Handbook of metaheuristics
- Bilevel programming with knapsack constraints
This page was built for publication: On Bilevel Optimization with Inexact Follower
