Interdiction Games on Markovian PERT Networks

Published Online:https://doi.org/10.1287/mnsc.2014.1973

References

  • Ash RB (1972) Real Analysis and Probability, Probability and Mathematical Statistics (Academic Press, Wltham, MA).Google Scholar
  • Bailey M, Shechter S, Schaefer A (2006) SPAR: Stochastic programming with adversarial recourse. Oper. Res. Lett. 34(3):307–315.CrossrefGoogle Scholar
  • Brown G, Carlyle W, Royset J, Wood K (2005) On the complexity of delaying an adversary’s project. Golden B, Raghavan S, Wasil E, eds. The Next Wave in Computing, Optimization, and Decision Technologies (Springer, New York), 3–17.CrossrefGoogle Scholar
  • Brown G, Carlyle W, Harney R, Skroch E, Wood K (2009) Interdicting a nuclear-weapons project. Oper. Res. 57(4):866–877.LinkGoogle Scholar
  • Buss A, Rosenblatt M (1997) Activity delay in stochastic project networks. Oper. Res. 45(1):126–139.LinkGoogle Scholar
  • Charnes A, Cooper W (1962) Programming with linear fractional functionals. Naval Res. Logist. Quart. 9(3–4):181–186.CrossrefGoogle Scholar
  • Cox D, Hinkley D (1974) Theoretical Statistics (Elsevier, Amsterdam).CrossrefGoogle Scholar
  • Creemers S, Leus R, Lambrecht M (2010) Scheduling Markovian PERT networks to maximize the net present value. Oper. Res. Lett. 38(1):51–56.CrossrefGoogle Scholar
  • Demeulemeester E, Vanhoucke M, Herroelen W (2003) RanGen: A random network generator for activity-on-the-node networks. J. Scheduling 6(1):17–38.CrossrefGoogle Scholar
  • Dimitrov NB, Morton DP (2012) Interdiction models and applications. Herrmann JW, ed. Handbook of Operations Research for Homeland Security (Springer, New York), 73–104.CrossrefGoogle Scholar
  • Fudenberg D, Tirole J (1991) Game Theory (MIT Press, Cambridge, MA).Google Scholar
  • Gutin E, Kuhn D, Wiesemann W (2014) Interdiction games on Markovian PERT networks. Technical report. Optimization Online: http://www.optimization-online.org/DB_HTML/2013/04/3830.html.Google Scholar
  • Hagstrom JN (1988) Computational complexity of PERT problems. Networks 18(2):139–147.CrossrefGoogle Scholar
  • Harchol-Balter M (2013) Performance Modeling and Design of Computer Systems. Queueing Theory in Action (Cambridge University Press, Cambridge, UK).Google Scholar
  • Harney R, Brown G, Carlyle M, Skroch E, Wood K (2006) Anatomy of a project to produce a first nuclear weapon. Sci. Global Security 14(2–3):163–182.CrossrefGoogle Scholar
  • Iyengar G (2005) Robust dynamic programming. Math. Oper. Res. 30(2):257–280.LinkGoogle Scholar
  • Kulkarni V, Adlakha V (1986) Markov and Markov-regenerative PERT networks. Oper. Res. 34(5):769–781.LinkGoogle Scholar
  • Lunday BJ, Sherali HD (2010) A dynamic network interdiction problem. Informatica 21(4):553–574.Google Scholar
  • Morton DP (2010) Stochastic network interdiction. Cochran JJ, ed. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ).Google Scholar
  • Nilim A, El Ghaoui L (2005) Robust control of Markov decision processes with uncertain transition matrices. Oper. Res. 53(5):780–798.LinkGoogle Scholar
  • Osogami T, Harchol-Balter M (2006) Closed form solutions for mapping general distributions to quasi-minimal PH distributions. Performance Evaluation 63(6):524–552.CrossrefGoogle Scholar
  • Pinker E, Szmerekovsky J, Tilson V (2013) Technical note—Managing a secret project. Oper. Res. 61(1):65–72.LinkGoogle Scholar
  • Puterman ML (1994) Markov Decision Processes: Discrete Stochastic Dynamic Programming (John Wiley & Sons, Hoboken, NJ).CrossrefGoogle Scholar
  • Sagan SD (2011) The causes of nuclear weapons proliferation. Annual Rev. Political Sci. 14:225–244.CrossrefGoogle Scholar
  • Smith JC (2010) Basic interdiction models. Cochran JJ, ed. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ).Google Scholar
  • Sobel M, Szmerekovsky J, Tilson V (2009) Scheduling projects with stochastic activity duration to maximize expected net present value. Eur. J. Oper. Res. 198(3):697–705.CrossrefGoogle Scholar
  • Wiesemann W, Kuhn D, Rustem B (2012) Multi-resource allocation in stochastic project scheduling. Ann. Oper. Res. 193(1):193–220.CrossrefGoogle Scholar
  • Wiesemann W, Kuhn D, Rustem B (2013) Robust Markov decision processes. Math. Oper. Res. 38(1):153–183.LinkGoogle Scholar
  • Wood RK (2010) Bilevel network interdiction models: Formulations and solutions. Cochran JJ, ed. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ).Google Scholar
  • Zheng J, Castañón DA (2012a) Dynamic network interdiction games with imperfect information and deception. Proc. 51st IEEE Conf. Decision and Control (IEEE, New York), 7758–7763.CrossrefGoogle Scholar
  • Zheng J, Castañón DA (2012b) Stochastic dynamic network interdiction games. Proc. 2012 Amer. Control Conf. (IEEE, New York), 1838–1844.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.