Interdiction models for delaying adversarial attacks against critical information technology infrastructure
Author
Abstract
Suggested Citation
DOI: 10.1002/nav.21859
Download full text from publisher
References listed on IDEAS
- Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
- Kaiyue Zheng & Laura A. Albert & James R. Luedtke & Eli Towle, 2019. "A budgeted maximum multiple coverage model for cybersecurity planning and management," IISE Transactions, Taylor & Francis Journals, vol. 51(12), pages 1303-1317, December.
- Pisinger, David, 1995. "A minimal algorithm for the multiple-choice knapsack problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 394-410, June.
- Kaiyue Zheng & Laura A. Albert, 2019. "A Robust Approach for Mitigating Risks in Cyber Supply Chains," Risk Analysis, John Wiley & Sons, vol. 39(9), pages 2076-2092, September.
- James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
- Kelly J. Cormican & David P. Morton & R. Kevin Wood, 1998. "Stochastic Network Interdiction," Operations Research, INFORMS, vol. 46(2), pages 184-197, April.
- Harald Held & Raymond Hemmecke & David L. Woodruff, 2005. "A decomposition algorithm applied to planning the interdiction of stochastic networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 321-328, June.
- Marshall L. Fisher, 1985. "An Applications Oriented Guide to Lagrangian Relaxation," Interfaces, INFORMS, vol. 15(2), pages 10-21, April.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
- Schmidt, Adam & Albert, Laura A. & Zheng, Kaiyue, 2021. "Risk management for cyber-infrastructure protection: A bi-objective integer programming approach," Reliability Engineering and System Safety, Elsevier, vol. 205(C).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
- Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
- Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
- Schmidt, Adam & Albert, Laura A. & Zheng, Kaiyue, 2021. "Risk management for cyber-infrastructure protection: A bi-objective integer programming approach," Reliability Engineering and System Safety, Elsevier, vol. 205(C).
- Huisman, D. & Jans, R.F. & Peeters, M. & Wagelmans, A.P.M., 2003. "Combining Column Generation and Lagrangian Relaxation," ERIM Report Series Research in Management ERS-2003-092-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- J. E. Beasley, 1990. "A lagrangian heuristic for set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 151-164, February.
- Chaya Losada & M. Scaparra & Richard Church & Mark Daskin, 2012. "The stochastic interdiction median problem with disruption intensity levels," Annals of Operations Research, Springer, vol. 201(1), pages 345-365, December.
- Lawrence V. Snyder & Mark S. Daskin, 2005. "Reliability Models for Facility Location: The Expected Failure Cost Case," Transportation Science, INFORMS, vol. 39(3), pages 400-416, August.
- X-Y Li & Y P Aneja & F Baki, 2010. "An ant colony optimization metaheuristic for single-path multicommodity network flow problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1340-1355, September.
- Ahmadi, Reza H. & Kouvelis, Panagiotis, 1999. "Design of electronic assembly lines: An analytical framework and its application," European Journal of Operational Research, Elsevier, vol. 115(1), pages 113-137, May.
- Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.
- Ojeong Kwon & Donghan Kang & Kyungsik Lee & Sungsoo Park, 1999. "Lagrangian relaxation approach to the targeting problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 640-653, September.
- Ali Diabat & Jean-Philippe Richard & Craig Codrington, 2013. "A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design," Annals of Operations Research, Springer, vol. 203(1), pages 55-80, March.
- Foad Iravani & Sriram Dasu & Reza Ahmadi, 2012. "A Hierarchical Framework for Organizing a Software Development Process," Operations Research, INFORMS, vol. 60(6), pages 1310-1322, December.
- Leyla Ozsen & Mark S. Daskin & Collette R. Coullard, 2009. "Facility Location Modeling and Inventory Management with Multisourcing," Transportation Science, INFORMS, vol. 43(4), pages 455-472, November.
- Siqian Shen & J. Cole Smith & Shabbir Ahmed, 2010. "Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths," Management Science, INFORMS, vol. 56(10), pages 1794-1814, October.
- Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.
- Mark S. Daskin, 2008. "What you should know about location modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 283-294, June.
- Snyder, Lawrence V. & Daskin, Mark S. & Teo, Chung-Piaw, 2007. "The stochastic location model with risk pooling," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1221-1238, June.
- Paola Cappanera & Maria Paola Scaparra, 2011. "Optimal Allocation of Protective Resources in Shortest-Path Networks," Transportation Science, INFORMS, vol. 45(1), pages 64-80, February.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:66:y:2019:i:5:p:411-429. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.