A simple greedy heuristic for linear assignment interdiction

DOI10.1007/s10479-016-2118-3zbMath1357.90079OpenAlexW2288966628MaRDI QIDQ513608

Oleg A. Prokopyev, Eduardo L. Pasiliao, Vladimir Stozhkov, Vladimir L. Boginski

Publication date: 7 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2118-3

zbMATH Keywords

bilevel programminglinear assignmentassignment interdiction

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (1)

On exact solution approaches for bilevel quadratic 0-1 knapsack problem

Cites Work

• Exact solution approaches for bilevel assignment problems
• Matching interdiction
• Restart strategies for GRASP with path-relinking heuristics
• The computational complexity of bilevel assignment problems
• Practical bilevel optimization. Algorithms and applications
• Multilevel optimization: algorithms and applications
• Links between linear bilevel and mixed 0-1 programming problems
• Foundations of bilevel programming
• Deterministic network interdiction
• Greedy randomized adaptive search procedures
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• Exact solution approach for a class of nonlinear bilevel knapsack problems
• An overview of bilevel optimization
• Assignment Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple greedy heuristic for linear assignment interdiction