An optimal algorithm for variable knockout problems

John Beasley

4OR, 2024, vol. 22, issue 4, No 1, 419-433

Abstract: Abstract We consider a class of problems related to variable knockout, where knockout means set a variable to zero. Given an optimisation problem formulated as a zero–one integer program the question we consider in this paper is what might be an appropriate set of variables to knockout of the problem, in order that the optimal solution to the problem that remains after variable knockout has a desired property. This property might be related to the optimal solution value after knockout, or require the problem after knockout to be infeasible. We present an algorithm for the optimal solution of this knockout problem. Computational results are given for an illustrative example based upon shortest path interdiction using publicly available shortest path test problems.

Keywords: Bilevel optimisation; Integer program; Network interdiction; Variable knockout; 90C10 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10288-023-00555-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:aqjoor:v:22:y:2024:i:4:d:10.1007_s10288-023-00555-3

Ordering information: This journal article can be ordered from
https://www.springer ... ch/journal/10288/PSE

DOI: 10.1007/s10288-023-00555-3

Access Statistics for this article

4OR is currently edited by Yves Crama, Michel Grabisch and Silvano Martello

More articles in 4OR from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().