An optimal algorithm for variable knockout problems
From MaRDI portal
Publication:6655140
DOI10.1007/s10288-023-00555-3MaRDI QIDQ6655140
Publication date: 20 December 2024
Published in: 4OR (Search for Journal in Brave)
Cites Work
- SCIP: solving constraint integer programs
- An effective and simple heuristic for the set covering problem
- An electromagnetism metaheuristic for the unicost set covering problem
- Path finding approaches and metabolic pathways
- Enhancing an algorithm for set covering problems
- A genetic algorithm for the set covering problem
- Bilevel and multilevel programming: A bibliography review
- Bilevel programming and applications
- An algorithm for set covering problem
- A survey of network interdiction models and algorithms
- An overview of bilevel optimization
- Integer programming methods for solving binary interdiction games
- Shortest path network interdiction with asymmetric information
- An algorithm for the resource constrained shortest path problem
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Shortest-path network interdiction
- A Heuristic Method for the Set Covering Problem
- A Backward Sampling Framework for Interdiction Problems with Fortification
- Algorithms for the set covering problem
- A survey on bilevel optimization under uncertainty
- A survey on mixed-integer programming techniques in bilevel optimization
- An exact method for binary fortification games
This page was built for publication: An optimal algorithm for variable knockout problems
