On bilevel optimization with inexact follower
From MaRDI portal
Recommendations
- Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- Bilevel linear optimization under uncertainty
- Bilevel linear programming with ambiguous objective function of the follower
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
Cites work
- A bilevel programming approach to determining tax credits for biofuel production
- A class of algorithms for mixed-integer bilevel min-max optimization
- A complexity and approximability study of the bilevel knapsack problem
- A cutting plane approach for bilevel hazardous material transport network design
- A dynamic programming algorithm for the bilevel Knapsack problem
- A New Algorithm for the 0-1 Knapsack Problem
- A new method for strong-weak linear bilevel programming problem
- A note on linearized reformulations for a class of bilevel linear integer problems
- A partial cooperation model for non-unique linear two-level decision problems
- A simple recipe for concise mixed 0-1 linearizations
- A study on the computational complexity of the bilevel knapsack problem
- An Algorithm for Large Zero-One Knapsack Problems
- An algorithm for the solution of the 0-1 knapsack problem
- An overview of bilevel optimization
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Bilevel knapsack with interdiction constraints
- Bilevel programming with knapsack constraints
- Computing Partitions with Applications to the Knapsack Problem
- Deterministic network interdiction
- Discrete linear bilevel programming problem
- Disjunctive cuts for continuous linear bilevel programming
- Dynamic programming algorithms for the zero-one knapsack problem
- Enhanced exact algorithms for discrete bilevel linear problems
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Existence of optimal solutions to mathematical programs with equilibrium constraints
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Foundations of bilevel programming
- Game theory
- Handbook of applied optimization
- Handbook of metaheuristics
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1163110 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 770227 (Why is no real title available?)
- Hybrid defensive resource allocations in the face of partially strategic attackers in a sequential defender-attacker game
- Linear bilevel programming with upper level constraints depending on the lower level solution
- Links between linear bilevel and mixed 0-1 programming problems
- Modeling a multitarget attacker-defender game with budget constraints
- New branch-and-Cut algorithm for bilevel linear programming
- On a class of bilevel linear mixed-integer programs in adversarial settings
- On the value of exposure and secrecy of defense system: first-mover advantage vs. robustness
- Practical bilevel optimization. Algorithms and applications
- Resource allocation for homeland defense: dealing with the team effect
- Robust discrete optimization and network flows
- Sequential Shortest Path Interdiction with Incomplete Information
- Simple models for multiattribute choice with many alternatives: when it does and does not pay to face trade-offs with binary attributes
- Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting
- Survivable network design under optimal and heuristic interdiction scenarios
- The bilevel knapsack problem with stochastic right-hand sides
- The Price of Robustness
- Weak linear bilevel programming problems: existence of solutions via a penalty method
Cited in
(14)- On a class of bilevel linear mixed-integer programs in adversarial settings
- On the Stackelberg knapsack game
- A robust approach for modeling limited observability in bilevel optimization
- Complexity of near-optimal robust versions of multilevel optimization problems
- Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- A survey on bilevel optimization under uncertainty
- Using neural networks to solve linear bilevel problems with unknown lower level
- 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
- On complexity of finding strong-weak solutions in bilevel linear programming
- Robust bilevel optimization for near-optimal lower-level solutions
- Designing a sports orienteering contest: physical versus cognitive skills in rogaining
This page was built for publication: On bilevel optimization with inexact follower
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120277)
