Exact algorithms and bounds for the dynamic assignment interdiction problem

DOI10.1002/nav.21753zbMath1411.90207OpenAlexW2754282170MaRDI QIDQ4632979

J. Cole Smith, Jorge A. Sefair

Publication date: 2 May 2019

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

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

zbMATH Keywords

dynamic programmingrobust optimizationassignment problemnetwork interdiction

Mathematics Subject Classification ID

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

Related Items (3)

A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ A survey of network interdiction models and algorithms ⋮ The continuous maximum capacity path interdiction problem

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