Exact algorithms and bounds for the dynamic assignment interdiction problem

DOI10.1002/NAV.21753MaRDI QIDQ4632979zbMATH OpenOpenAlexFDO

Authors Jorge A. Sefair, J. Cole Smith

Publication date 2 May 2019

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.21753

zbMATH Keywords

assignment problemdynamic programmingnetwork interdictionrobust optimization

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Dynamic programming (90C39) Games in extensive form (91A18) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• Dynamic shortest-path interdiction
• A simple greedy heuristic for linear assignment interdiction
• A dynamic network interdiction problem
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
• Network interdiction with asymmetric cost uncertainty

Cited in

(8)

• The continuous maximum capacity path interdiction problem
• A survey of network interdiction models and algorithms
• A cutting-plane algorithm for solving a weighted influence interdiction problem
• Adaptive labeling algorithms for the dynamic assignment problem
• scientific article; zbMATH DE number 1057929 (Why is no real title available?)
• Dynamic shortest-path interdiction
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
• A simple greedy heuristic for linear assignment interdiction

This page was built for publication: Exact algorithms and bounds for the dynamic assignment interdiction problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632979)