Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahuja, R.K., Magnanti, T.L. and Orlin, J.B. (1993). Network Flows: Theory, Algorithms, and Applications: Upper Saddle River, NJ: Prentice-Hall.
Brown, G.G, Carlyle, W.M., Harney, R. C, Skroch, E. M. and Wood, R. K., (2004). “Interdicting a Nuclear Weapons Project,” draft, May 9.
Carlyle, W.M. and Wood, R.K., (2003). “Lagrangian Relaxation and Enumeration for Solving Constrained Shortest Paths,” Proceedings of the 38th Annual ORSNZ Conference, University of Waikato, Hamilton, New Zealand, 21–22 November, pp. 3–12.
Crowston, W. and Thompson, G.L. (1967). “Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of Projects,” Operations Research, 15, pp. 407–426.
De, P., Dunne, E.J., Ghosh, J.B., Wells, C.E. (1997). “Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks,” Operations Research, 45, pp. 302–306.
Israeli, E. and Wood, R.K. (2002). “Shortest-path Network Interdiction,” Networks, 40, pp. 97–111.
Elmaghraby, S.E. (1977). Activity Networks. New York: Wiley.
Garey, M.R. and Johnson, D.S. (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. New York: W. H. Freeman and Co.
Handler, G.Y. and Zang, I. (1980). A Dual Algorithm for the Constrained Shortest Path Problem, Networks, 10, pp. 293–310.
Hindelang, T.J. and Muth, J.F. (1979) “A Dynamic Programming Algorithm for Decision CPM Networks” Operations Research, 27, pp. 225–241.
Malcolm, D.G., Roseboom, J.H., Clark, C.E., and Fazar, W. (1959) “Application of a Technique for Research and Development Program Evaluation,” Operations Research, 7, pp. 646–669.
Moder, J.J., Phillips, C.R., and Davis, E.W. (1983). Project Management with CPM, PERT and Precedence Diagramming, 3rd ed. New York: Van Nostrand Reinhold Company Inc.
Moore, J.T. and Bard, J.F. (1990). “The Mixed Integer Linear Bilevel Programming Problem,” Operations Research, 38, pp. 911–921.
PERT. (1958). “Program Evaluation Research Task, Phase 1 Summary Report,” Special Projects Office, Bureau of Ordinance, 7, Department of the Navy, Washington, D.C., pp. 646–669.
Reed, B. K. (1994). “Models for Proliferation Interdiction Response Analysis,” Masters Thesis, Naval Postgraduate School, Monterey, California, September.
Skroch, E. (2004). “How to Optimally Interdict a Belligerent Project to Develop a Nuclear Weapon,” Masters Thesis, Naval Postgraduate School, Monterey, California, September.
Spears, D. (ed.). (2001). “Technology R&D for Arms Control. Arms Control and Nonproliferation Technologies”, US Department of Energy, National Nuclear Security Administration, Defense Nuclear Nonproliferation Programs, Washington, D.C.
von Stackelberg, H. (1952). The Theory of the Market Economy, (trans. from German). London: William Hodge & Co.
Wood, R.K. (1993). “Deterministic Network Interdiction,” Mathematical and Computer Modelling, 17, pp. 1–18.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Brown, G.G., Carlyle, W.M., Royset, J.O., Wood, R.K. (2005). On the Complexity of Delaying an Adversary’s Project. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Next Wave in Computing, Optimization, and Decision Technologies. Operations Research/Computer Science Interfaces Series, vol 29. Springer, Boston, MA . https://doi.org/10.1007/0-387-23529-9_1
Download citation
DOI: https://doi.org/10.1007/0-387-23529-9_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23528-8
Online ISBN: 978-0-387-23529-5
eBook Packages: Computer ScienceComputer Science (R0)