A dynamic reformulation heuristic for generalized interdiction problems
From MaRDI portal
Recommendations
- Integer programming methods for solving binary interdiction games
- Bilevel knapsack with interdiction constraints
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Exact solution approaches for a class of bilevel fractional programs
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
Cites work
- A class of algorithms for mixed-integer bilevel min-max optimization
- A hybrid tabu-ascent algorithm for the linear bilevel programming problem
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- A new approach for solving linear bilevel problems using genetic algorithms
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A simple algorithm for the-linear bilevel programming problem
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- A study on the computational complexity of the bilevel knapsack problem
- An evolutionary algorithm for polishing mixed integer programming solutions
- Benchmarking optimization software with performance profiles.
- Bilevel knapsack with interdiction constraints
- Bilevel programming and the separation problem
- Deterministic network interdiction
- Disjunctive cuts for continuous linear bilevel programming
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Efficient determination of the k most vital edges for the minimum spanning tree problem
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Heuristics for multi-stage interdiction of stochastic networks
- Interdicting a Nuclear-Weapons Project
- Intersection cuts for bilevel optimization
- Maximizing the minimum source-sink path subject to a budget constraint
- Metaheuristics for bi-level optimization
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On the numerical solution of a class of Stackelberg problems
- Parametric integer programming algorithm for bilevel mixed integer programs
- Shortest-path network interdiction
- The Mixed Integer Linear Bilevel Programming Problem
- The most vital nodes with respect to independent set and vertex cover
- Two-Person Zero-Sum Games for Network Interdiction
- Weak via strong Stackelberg problem: New results
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
Cited in
(22)- A branch-and-cut algorithm for the edge interdiction clique problem
- Reformulations and complexity of the clique interdiction problem by graph mapping
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- Complexity of the multilevel critical node problem
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- On the Stackelberg knapsack game
- 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
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- DASH: dynamic approach for switching heuristics
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- Why there is no need to use a big-\(M\) in linear bilevel optimization: a computational study of two ready-to-use approaches
- Exact solution approaches for a class of bilevel fractional programs
- An exact method for nonlinear network flow interdiction problems
- Presolving linear bilevel optimization problems
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Bilevel optimization: theory, algorithms, applications and a bibliography
- A study of general and security Stackelberg game formulations
- A simple greedy heuristic for linear assignment interdiction
- A brief overview of interdiction and robust optimization
This page was built for publication: A dynamic reformulation heuristic for generalized interdiction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754203)
