A "project manager" wishes to complete a project (e.g., a weapons development program) as quickly as possible. Using a limited interdiction budget, an "interdictor" wishes to delay the project's overall completion time by interdicting and thereby delaying some of the project's component tasks. We explore a variety of PERT-based interdiction models for such problems and show that the resulting problem complexities run the gamut: polynomially solvable, weakly NP-complete, strongly NP-complete or NP-hard. We suggest methods for solving the problems that are easier than worst-case complexity implies. © 2005 Springer Science+Business Media, Inc.
CITATION STYLE
Brown, G. G., Carlyle, W. M., Royset, J. O., & Wood, R. K. (2005). On the complexity of delaying an adversary’s project. Operations Research/ Computer Science Interfaces Series, 29, 3–17. https://doi.org/10.1007/0-387-23529-9_1
Mendeley helps you to discover research relevant for your work.