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...

Full description

Bibliographic Details

Published in:	Naval research logistics Vol. 64; no. 5; pp. 373 - 387
Main Authors:	Sefair, Jorge A., Smith, J. Cole
Format:	Journal Article
Language:	English
Published:	New York Wiley Subscription Services, Inc 01.08.2017
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!