A dynamic reformulation heuristic for generalized interdiction problems
From MaRDI portal
Publication:1754203
DOI10.1016/j.ejor.2017.11.043zbMath1403.90524OpenAlexW2769797184MaRDI QIDQ1754203
Michele Monaci, Markus Sinnl, Matteo Fischetti
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11585/623006
heuristicsmixed-integer programmingbilevel optimizationinterdiction problems(O) combinatorial optimization
Mixed integer programming (90C11) Hierarchical games (including Stackelberg games) (91A65) Applications of game theory (91A80) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Complexity of the multilevel critical node problem, Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets, 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, Why there is no need to use a big-\(M\) in linear bilevel optimization: a computational study of two ready-to-use approaches, An exact approach for the bilevel knapsack problem with interdiction constraints and extensions, Presolving linear bilevel optimization problems, A Brief Overview of Interdiction and Robust Optimization, A study of general and security Stackelberg game formulations, On the Stackelberg knapsack game, A branch-and-cut algorithm for the edge interdiction clique problem, Closing the gap in linear bilevel optimization: a new valid primal-dual inequality, Outer approximation for global optimization of mixed-integer quadratic bilevel problems, Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Uses Software
Cites Work
- A class of algorithms for mixed-integer bilevel min-max optimization
- Metaheuristics for bi-level optimization
- Bilevel programming and the separation problem
- The most vital nodes with respect to independent set and vertex cover
- Parametric integer programming algorithm for bilevel mixed integer programs
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem
- Deterministic network interdiction
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A hybrid tabu-ascent algorithm for the linear bilevel programming problem
- Weak via strong Stackelberg problem: New results
- Disjunctive cuts for continuous linear bilevel programming
- A new approach for solving linear bilevel problems using genetic algorithms
- Heuristics for multi-stage interdiction of stochastic networks
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Interdicting a Nuclear-Weapons Project
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Intersection Cuts for Bilevel Optimization
- Bilevel Knapsack with Interdiction Constraints
- A Study on the Computational Complexity of the Bilevel Knapsack Problem
- On the numerical solution of a class of Stackelberg problems
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- A simple algorithm for the-linear bilevel programming problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Maximizing the minimum source-sink path subject to a budget constraint
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Shortest-path network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- The Mixed Integer Linear Bilevel Programming Problem
- Benchmarking optimization software with performance profiles.
