Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Resource Constrained Shortest Paths
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
The revolution in military affairs: Its driving forces, elements, and complexity
Complexity - Security and Complexity
Shorter path constraints for the resource constrained shortest path problem
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Optimal investment in development projects
Operations Research Letters
Expenditure patterns and timing of patent protection in a competitive R&D environment
Operations Research Letters
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Sharing Rewards Among Strangers Based on Peer Evaluations
Decision Analysis
| Hi-index | 0.00 |
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.