Exact methods for discrete -robust interdiction problems with an application to the bilevel knapsack problem
From MaRDI portal
Publication:6062886
Recommendations
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Bilevel knapsack with interdiction constraints
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
Cites work
- A bilevel model of taxation and its application to optimal highway pricing
- A Bilevel Stochastic Programming Problem with Random Parameters in the Follower’s Objective Function
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A branch-and-cut algorithm for the edge interdiction clique problem
- A class of algorithms for mixed-integer bilevel min-max optimization
- A complexity and approximability study of the bilevel knapsack problem
- A dynamic reformulation heuristic for generalized interdiction problems
- A multilevel model of the European entry-exit gas market
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
- A problem in network interdiction
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A robust approach for modeling limited observability in bilevel optimization
- A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
- A survey of network interdiction models and algorithms
- A survey on bilevel optimization under uncertainty
- A survey on mixed-integer programming techniques in bilevel optimization
- A unified framework for multistage mixed integer linear optimization
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Bilevel knapsack with interdiction constraints
- Bilevel linear optimization under uncertainty
- Bilevel programming in traffic planning: Models, methods and challenge
- Bilevel road pricing: theoretical analysis and optimality conditions
- Blockers and transversals
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- Complexity of near-optimal robust versions of multilevel optimization problems
- Construction of a real-world bilevel linear programming model of the highway network design problem
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Decision rule bounds for two-stage stochastic bilevel programs
- Distributionally robust optimization and its tractable approximations
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
- Foundations of bilevel programming
- Generalized Benders decomposition
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Intersection cuts for bilevel optimization
- Introduction to stochastic programming.
- Minimum cost edge blocker clique problem
- Minimum edge blocker dominating set problem
- Minimum vertex blocker clique problem
- Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On bilevel optimization with inexact follower
- On integer and bilevel formulations for the \(k\)-vertex cut problem
- On the complexity of robust bilevel optimization with uncertain follower's objective
- On the use of intersection cuts for bilevel optimization
- Partitioning procedures for solving mixed-variables programming problems
- Reduction of the bilevel stochastic optimization problem with quantile objective function to a mixed‐integer problem
- Risk-averse models in bilevel stochastic linear programming
- Robust discrete optimization and network flows
- Shortest-path network interdiction
- Stochastic network interdiction
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Mixed Integer Linear Bilevel Programming Problem
- The Price of Robustness
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
- Theory and applications of robust optimization
- Valid inequalities for mixed integer linear programs
Cited in
(4)- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
- Learning the follower's objective function in sequential bilevel games
- Existence of solutions in bilevel stochastic linear programming with integer variables in the lower level problem
- Data-driven interdiction with asymmetric cost uncertainty: a distributionally robust optimization approach
This page was built for publication: Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062886)
