A simple greedy heuristic for linear assignment interdiction

Vladimir Stozhkov (), Vladimir Boginski (), Oleg A. Prokopyev () and Eduardo L. Pasiliao ()
Additional contact information
Vladimir Stozhkov: University of Florida
Vladimir Boginski: University of Florida
Oleg A. Prokopyev: University of Pittsburgh
Eduardo L. Pasiliao: Air Force Research Laboratory

Annals of Operations Research, 2017, vol. 249, issue 1, No 4, 39-53

Abstract: Abstract We consider a bilevel extension of the classical linear assignment problem motivated by network interdiction applications. Specifically, given a bipartite graph with two different (namely, the leader’s and the follower’s) edge costs, the follower solves a linear assignment problem maximizing his/her own profit, whereas the leader is allowed to affect the follower’s decisions by eliminating some of the vertices from the graph. The leader’s objective is to minimize the total cost given by the cost of the interdiction actions plus the cost of the assignments made by the follower. The considered problem is strongly $${ NP}$$ N P -hard. First, we formulate this problem as a linear mixed integer program (MIP), which can be solved by commercial MIP solvers. More importantly, we also describe a greedy-based construction heuristic, which provides (under some mild conditions) an optimal solution for the case, where the leader’s and the follower’s edge costs are equal to one. Finally, we present the results of our computational experiments comparing the proposed heuristic against an MIP solver.

Keywords: Bilevel programming; Assignment interdiction; Linear assignment (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-016-2118-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:annopr:v:249:y:2017:i:1:d:10.1007_s10479-016-2118-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-016-2118-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().