An iterative generate-and-cover algorithm computes optimal variable knockout sets for integer programs, demonstrated on shortest path interdiction instances.
Shortest path network interdiction with asymmetric information
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An algorithm for the optimal solution of variable knockout problems
An iterative generate-and-cover algorithm computes optimal variable knockout sets for integer programs, demonstrated on shortest path interdiction instances.