On a class of bilevel linear mixed-integer programs in adversarial settings
From MaRDI portal
Publication:1754450
DOI10.1007/s10898-017-0549-2zbMath1417.90107OpenAlexW2747319311MaRDI QIDQ1754450
Oleg A. Prokopyev, Osman Y. Özaltın, M. Hosein Zare
Publication date: 30 May 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0549-2
computational complexitypessimistic bilevel programsbilevel linear programsbilevel linear mixed integer programsstrong-weak approach
Related Items (9)
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective ⋮ A new methodology for solving piecewise quadratic fuzzy cooperative continuous static games ⋮ Bilevel Integer Programs with Stochastic Right-Hand Sides ⋮ A survey on bilevel optimization under uncertainty ⋮ On Bilevel Optimization with Inexact Follower ⋮ Complexity of near-optimal robust versions of multilevel optimization problems ⋮ A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem ⋮ Guest editors' preface to the special issue devoted to the 2nd international conference ``Numerical computations: theory and algorithms, June 19--25, 2016, Pizzo Calabro, Italy ⋮ Pessimistic evasive flow capturing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of algorithms for mixed-integer bilevel min-max optimization
- Enhanced exact algorithms for discrete bilevel linear problems
- Practical bilevel optimization. Algorithms and applications
- \(\epsilon\)-mixed strategies for static continuous-kernel Stackelberg games
- Handbook of global optimization
- Multilevel optimization: algorithms and applications
- Links between linear bilevel and mixed 0-1 programming problems
- 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
- Deterministic network interdiction
- Bilevel programming in traffic planning: Models, methods and challenge
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Robust optimization for the hazardous materials transportation network design problem
- A cutting plane approach for bilevel hazardous material transport network design
- 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
- Shortest path network interdiction with asymmetric information
- New Branch-and-Bound Rules for Linear Bilevel Programming
- A Mathematical Model and Descent Algorithm for Bilevel Traffic Management
- Shortest-path network interdiction
- Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
This page was built for publication: On a class of bilevel linear mixed-integer programs in adversarial settings
