Network Optimization Models for Resource Allocation in Developing Military Countermeasures

Published Online:https://doi.org/10.1287/opre.1110.1002

References

  • Beasley J. E., Christofides N. An algorithm for the resource constrained shortest path problem. Networks (1989) 19(3):379–394CrossrefGoogle Scholar
  • Burnett W. M., Monetta D. J., Silverman B. G. How the Gas Research Institute (GRI) helped transform the US natural gas industry. Interfaces (1993) 23(1):44–58LinkGoogle Scholar
  • Carlyle W. M., Wood R. K. Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Proc. 38th Annual ORSNZ Conf. (2003) (University of Waikato, Hamilton, New Zealand) Google Scholar
  • Dumitrescu I., Boland N. Algorithms for the weight constrained shortest path problem. Internat. Trans. Oper. Res. (2001) 8(1):15–29CrossrefGoogle Scholar
  • Etcheson C.Arms Race Theory: Strategy and Structure of Behavior (1989) (Greenwood Press, New York) Google Scholar
  • Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco) Google Scholar
  • Gellermann T., Sellmann M., Wright R., Bartak R., Milano M. Shorter path constraints for the resource constrained shortest path Problem. CPAIOR 2005, LNCS 3524 (2005) (Springer-Verlag, Berlin) 201–216CrossrefGoogle Scholar
  • Golany B., Rothblum U. G. Optimal investment in development projects. Oper. Res. Lett. (2008) 36(6):657–661CrossrefGoogle Scholar
  • Golany B., Kress M., Penn M., Rothblum U. G. Resource allocation in tactical arms race with temporary advantage. Naval Res. Logistics (2012) . ForthcomingCrossrefGoogle Scholar
  • Hassin R. Approximation schemes for the restricted shortest path problem. Math. Oper. Res. (1992) 17(1):36–42LinkGoogle Scholar
  • Kamien M., Schwartz N. Expenditure patterns for risky R&D projects. J. Appl. Probab. (1971) 8(1):60-73CrossrefGoogle Scholar
  • Koubi V. Military technology races. Internat. Organ. (1999) 53(3):537–555CrossrefGoogle Scholar
  • Mehlhorn K., Ziegelmann M. Resource constrained shortest paths. Proc. 8th Eur. Sympos. Algorithms (ESA) (2000) 326–337Springer LNCS 1879CrossrefGoogle Scholar
  • Neuneck G. The revolution in military affairs: Its driving forces, elements, and complexity. Complexity (2008) 14(1):50–61CrossrefGoogle Scholar
  • Spector Y., Zuckerman D. Expenditure patterns and timing of patent protection in a competitive R&D environment. Oper. Res. Lett. (1997) 20(5):237–242CrossrefGoogle Scholar
  • Wang Z., Crowcroft J. Quality-of-service routing for supporting multimedia applications. IEEE Selected Areas Comm. (1996) 14(7):1228–1234CrossrefGoogle 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.