IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v60y2012i1p48-63.html
   My bibliography  Save this article

Network Optimization Models for Resource Allocation in Developing Military Countermeasures

Author

Listed:
  • Boaz Golany

    (Technion--Israel Institute of Technology, Haifa 32000, Israel)

  • Moshe Kress

    (Operations Research Department, Naval Postgraduate School, Monterey, California 93940)

  • Michal Penn

    (Technion--Israel Institute of Technology, Haifa 32000, Israel)

  • Uriel G. Rothblum

    (Technion--Israel Institute of Technology, Haifa 32000, Israel)

Abstract

A military arms race is characterized by an iterative development of measures and countermeasures. An attacker attempts to introduce new weapons in order to gain some advantage, whereas a defender attempts to develop countermeasures that can mitigate or even eliminate the effects of the weapons. This paper addresses the defender's decision problem: given limited resources, which countermeasures should be developed and how much should be invested in their development to minimize the damage caused by the attacker's weapons over a certain time horizon. We formulate several optimization models, corresponding to different operational settings, as constrained shortest-path problems and variants thereof. We then demonstrate the potential applicability and robustness of this approach with respect to various scenarios.

Suggested Citation

  • Boaz Golany & Moshe Kress & Michal Penn & Uriel G. Rothblum, 2012. "Network Optimization Models for Resource Allocation in Developing Military Countermeasures," Operations Research, INFORMS, vol. 60(1), pages 48-63, February.
    • Handle: RePEc:inm:oropre:v:60:y:2012:i:1:p:48-63
    DOI: 10.1287/opre.1110.1002
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1110.1002
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1110.1002?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Koubi, Vally, 1999. "Military Technology Races," International Organization, Cambridge University Press, vol. 53(3), pages 537-565, July.
    2. Refael Hassin, 1992. "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 36-42, February.
    3. William M. Burnett & Dominic J. Monetta & Barry G. Silverman, 1993. "How the Gas Research Institute (GRI) Helped Transform the US Natural Gas Industry," Interfaces, INFORMS, vol. 23(1), pages 44-58, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Shun & Zhao, Xudong & Chen, Zhilong & Hou, Benwei & Wu, Yipeng, 2022. "A game-theoretic method to optimize allocation of defensive resource to protect urban water treatment plants against physical attacks," International Journal of Critical Infrastructure Protection, Elsevier, vol. 36(C).
    2. Zhang, Xiaoxiong & Ye, Yanqing & Tan, Yuejin, 2020. "How to protect a genuine target against an attacker trying to detect false targets," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    3. David Simchi-Levi & Nikolaos Trichakis & Peter Yun Zhang, 2019. "Designing Response Supply Chain Against Bioattacks," Operations Research, INFORMS, vol. 67(5), pages 1246-1268, September.
    4. Jian Xiong & Rui Wang & Jiang Jiang, 2019. "Weapon Selection and Planning Problems Using MOEA/D with Distance-Based Divided Neighborhoods," Complexity, Hindawi, vol. 2019, pages 1-18, November.
    5. Levitin, Gregory & Hausken, Kjell & Dai, Yuanshun, 2014. "Optimal defense with variable number of overarching and individual protections," Reliability Engineering and System Safety, Elsevier, vol. 123(C), pages 81-90.
    6. Arthur Carvalho & Kate Larson, 2012. "Sharing Rewards Among Strangers Based on Peer Evaluations," Decision Analysis, INFORMS, vol. 9(3), pages 253-273, September.

    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.
    1. Esaignani Selvarajah & Rui Zhang, 2014. "Supply chain scheduling to minimize holding costs with outsourcing," Annals of Operations Research, Springer, vol. 217(1), pages 479-490, June.
    2. Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann, 1998. "Facility Location with Dynamic Distance Functions," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 199-217, September.
    3. Geng, Zhichao & Yuan, Jinjiang, 2023. "Single-machine scheduling of multiple projects with controllable processing times," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1074-1090.
    4. Peter C. Bell & Chris K. Anderson, 2002. "In Search of Strategic Operations Research/Management Science," Interfaces, INFORMS, vol. 32(2), pages 28-40, April.
    5. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
    6. Faramroze G. Engineer & George L. Nemhauser & Martin W. P. Savelsbergh, 2011. "Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 105-119, February.
    7. Buu-Chau Truong & Kim-Hung Pho & Van-Buol Nguyen & Bui Anh Tuan & Wing-Keung Wong, 2019. "Graph Theory And Environmental Algorithmic Solutions To Assign Vehicles Application To Garbage Collection In Vietnam," Advances in Decision Sciences, Asia University, Taiwan, vol. 23(3), pages 1-35, September.
    8. Peter C. Bell & Chris K. Anderson & Stephen P. Kaiser, 2003. "Strategic Operations Research and the Edelman Prize Finalist Applications 1989--1998," Operations Research, INFORMS, vol. 51(1), pages 17-31, February.
    9. Michael Holzhauser & Sven O. Krumke, 2018. "A generalized approximation framework for fractional network flow and packing problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 19-50, February.
    10. Luigi Di Puglia Pugliese & Francesca Guerriero, 2013. "A Reference Point Approach for the Resource Constrained Shortest Path Problems," Transportation Science, INFORMS, vol. 47(2), pages 247-265, May.
    11. Chen, Xujin & Hu, Jie & Hu, Xiaodong, 2009. "A polynomial solvable minimum risk spanning tree problem with interval data," European Journal of Operational Research, Elsevier, vol. 198(1), pages 43-46, October.
    12. Jenkins , Alan, 2005. "Performance Appraisal Research: A Critical Review of Work on “The Social Context and Politics of Appraisal”," ESSEC Working Papers DR 05004, ESSEC Research Center, ESSEC Business School.
    13. Junran Lichen & Jianping Li & Ko-Wei Lih & Xingxing Yu, 0. "Approximation algorithms for constructing required subgraphs using stock pieces of fixed length," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-22.
    14. Vittorio Bilò & Ioannis Caragiannis & Angelo Fanelli & Michele Flammini & Gianpiero Monaco, 2017. "Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems," Post-Print hal-02089412, HAL.
    15. Jianping Li & Weidong Li & Junran Lichen, 2014. "The subdivision-constrained routing requests problem," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 152-163, January.
    16. Mattia, Sara & Rossi, Fabrizio & Servilio, Mara & Smriglio, Stefano, 2017. "Staffing and scheduling flexible call centers by two-stage robust optimization," Omega, Elsevier, vol. 72(C), pages 25-37.
    17. Sven O. Krumke & Madhav V. Marathe & Hartmut Noltemeier & R. Ravi & S. S. Ravi, 1998. "Approximation Algorithms for Certain Network Improvement Problems," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 257-288, September.
    18. Wei Ding & Guoliang Xue, 2014. "Minimum diameter cost-constrained Steiner trees," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 32-48, January.
    19. Sedeño-Noda, Antonio & Alonso-Rodríguez, Sergio, 2015. "An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 602-618.
    20. Arne Herzel & Stefan Ruzika & Clemens Thielen, 2021. "Approximation Methods for Multiobjective Optimization Problems: A Survey," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1284-1299, October.

    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:inm:oropre:v:60:y:2012:i:1:p:48-63. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.