An optimal algorithm for variable knockout problems
From MaRDI portal
Recommendations
- Reducing the number of variables in integer and linear programming problems
- Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- A note on reducing the number of variables in integer programming problems
- Variable fixing algorithms for the continuous quadratic Knapsack problem
Cites work
- A Backward Sampling Framework for Interdiction Problems with Fortification
- A Heuristic Method for the Set Covering Problem
- A genetic algorithm for the set covering problem
- 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
- Algorithms for the set covering problem
- An algorithm for set covering problem
- An algorithm for the resource constrained shortest path problem
- An effective and simple heuristic for the set covering problem
- An electromagnetism metaheuristic for the unicost set covering problem
- An exact method for binary fortification games
- An overview of bilevel optimization
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel and multilevel programming: A bibliography review
- Bilevel programming and applications
- Enhancing an algorithm for set covering problems
- Integer programming methods for solving binary interdiction games
- Path finding approaches and metabolic pathways
- SCIP: solving constraint integer programs
- Shortest path network interdiction with asymmetric information
- Shortest-path network interdiction
This page was built for publication: An optimal algorithm for variable knockout problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655140)
