A class of algorithms for mixed-integer bilevel min-max optimization
From MaRDI portal
Recommendations
- An algorithm for the mixed-integer nonlinear bilevel programming problem
- scientific article; zbMATH DE number 35514
- The Mixed Integer Linear Bilevel Programming Problem
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
Cites work
- scientific article; zbMATH DE number 2132174 (Why is no real title available?)
- scientific article; zbMATH DE number 35514 (Why is no real title available?)
- A complexity and approximability study of the bilevel knapsack problem
- A dynamic programming algorithm for the bilevel Knapsack problem
- A problem in network interdiction
- Approaches to sensitivity analysis in linear programming
- Bilevel programming with knapsack constraints
- Deterministic network interdiction
- Discrete linear bilevel programming problem
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Finding the n Most Vital Links in Flow Networks
- Finding the most vital arcs in a network
- Foundations of bilevel programming
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Maximizing the minimum source-sink path subject to a budget constraint
- Minimum vertex blocker clique problem
- Most vital links and nodes in weighted networks
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Nonlinear Programming
- On the continuity of the value of a linear program and of related polyhedral-valued multifunctions
- On two-level optimization
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- Removing Arcs from a Network
- Shortest-path network interdiction
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The Mixed Integer Linear Bilevel Programming Problem
- The Theory of Max-Min, with Applications
- The k most vital arcs in the shortest path problem
- Two-Level Linear Programming
Cited in
(41)- Minimum cost edge blocker clique problem
- A branch-and-cut algorithm for the edge interdiction clique problem
- Min-Max Optimal Design of Two-Armed Trials with Side Information
- Reformulations and complexity of the clique interdiction problem by graph mapping
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- The maximum clique interdiction problem
- The Maximal covering location disruption problem
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Algorithms and applications for a class of bilevel MILPs
- Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
- On a class of bilevel linear mixed-integer programs in adversarial settings
- An exact method for binary fortification games
- Exact algorithms for the minimum cost vertex blocker clique problem
- On bilevel optimization with inexact follower
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- A survey of network interdiction models and algorithms
- Robust location for quarantine facilities under decentralized room assignment: a bi-level mixed-integer programming approach
- Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- An algorithm for the mixed-integer nonlinear bilevel programming problem
- Robust multiperiod vehicle routing under customer order uncertainty
- Why there is no need to use a big-M in linear bilevel optimization: a computational study of two ready-to-use approaches
- A survey on mixed-integer programming techniques in bilevel optimization
- On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- Learning primal heuristics for 0-1 knapsack interdiction problems
- Provable training set debugging for linear regression
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- A dynamic reformulation heuristic for generalized interdiction problems
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- On designing networks resilient to clique blockers
- Bilevel optimization: theory, algorithms, applications and a bibliography
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- An exact approach for the Stackelberg knapsack problem with weight selection
This page was built for publication: A class of algorithms for mixed-integer bilevel min-max optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330266)
