A simple greedy heuristic for linear assignment interdiction
type: Item
instance of: scholarly article
title: A simple greedy heuristic for linear assignment interdiction
zbMATH Open document ID: 1357.90079
author: Vladimir Stozhkov
author: Oleg A. Prokopyev
author: Eduardo L. Pasiliao
author: Vladimir Boginski
published in: Annals of Operations Research
publication date: 2017-03-07T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6692547
zbMATH Keywords: bilevel programming
zbMATH Keywords: assignment interdiction
zbMATH Keywords: linear assignment
MaRDI profile type: Publication
full work available at URL: s10479-016-2118-3
OpenAlex ID: W2288966628
cites work: Links between linear bilevel and mixed 0-1 programming problems
cites work: Practical bilevel optimization. Algorithms and applications
cites work: Exact solution approach for a class of nonlinear bilevel knapsack problems
cites work: Exact solution approaches for bilevel assignment problems
cites work: Assignment Problems
cites work: An overview of bilevel optimization
cites work: Foundations of bilevel programming
cites work: Q4394599
cites work: Greedy randomized adaptive search procedures
cites work: Q4198056
cites work: The computational complexity of bilevel assignment problems
cites work: Multilevel optimization: algorithms and applications
cites work: Q4040221
cites work: Restart strategies for GRASP with path-relinking heuristics
cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions
cites work: Deterministic network interdiction
cites work: Matching interdiction
DOI: 10.1007/S10479-016-2118-3
description: scientific article; zbMATH DE number 6692547