Exact algorithms and bounds for the dynamic assignment interdiction problem

We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user...

Celý popis

Podrobná bibliografia

Vydané v:	Naval research logistics Ročník 64; číslo 5; s. 373 - 387
Hlavní autori:	Sefair, Jorge A., Smith, J. Cole
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Wiley Subscription Services, Inc 01.08.2017
Predmet:	Algorithms assignment problem Costs dynamic programming Games Logistics Mathematical models Minimum cost network interdiction Objective function robust optimization Upper bounds
ISSN:	0894-069X, 1520-6750
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!