On a class of bilevel linear mixed-integer programs in adversarial settings
From MaRDI portal
Recommendations
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- On bilevel optimization with inexact follower
- The Mixed Integer Linear Bilevel Programming Problem
- A bilevel “Attacker–Defender” model to choosing the composition of attack means
- Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
Cites work
- \(\epsilon\)-mixed strategies for static continuous-kernel Stackelberg games
- A bilevel programming approach to determining tax credits for biofuel production
- A class of algorithms for mixed-integer bilevel min-max optimization
- A cutting plane approach for bilevel hazardous material transport network design
- A Mathematical Model and Descent Algorithm for Bilevel Traffic Management
- A new method for strong-weak linear bilevel programming problem
- A partial cooperation model for non-unique linear two-level decision problems
- An overview of bilevel optimization
- Bilevel programming in traffic planning: Models, methods and challenge
- Deterministic network interdiction
- Disjunctive cuts for continuous linear bilevel programming
- Enhanced exact algorithms for discrete bilevel linear problems
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Foundations of bilevel programming
- Handbook of global optimization
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330032 (Why is no real title available?)
- scientific article; zbMATH DE number 1163110 (Why is no real title available?)
- scientific article; zbMATH DE number 770227 (Why is no real title available?)
- Links between linear bilevel and mixed 0-1 programming problems
- Multilevel optimization: algorithms and applications
- New Branch-and-Bound Rules for Linear Bilevel Programming
- New branch-and-Cut algorithm for bilevel linear programming
- Practical bilevel optimization. Algorithms and applications
- Robust optimization for the hazardous materials transportation network design problem
- Sensitivity analysis for two-level value functions with applications to bilevel programming
- Shortest path network interdiction with asymmetric information
- Shortest-path network interdiction
Cited in
(15)- 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
- 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
- Complexity of near-optimal robust versions of multilevel optimization problems
- Bilevel `defender-attacker' model with multiple attack scenarios
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- On bilevel optimization with inexact follower
- A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem
- A survey on bilevel optimization under uncertainty
- On complexity of finding strong-weak solutions in bilevel linear programming
- Robust bilevel optimization for near-optimal lower-level solutions
- Existence of solutions in bilevel stochastic linear programming with integer variables in the lower level problem
- On strong duality based reformulations for a class of bilevel linear programs
This page was built for publication: On a class of bilevel linear mixed-integer programs in adversarial settings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754450)
