A simple model of optimal clearance of improvised explosive devices
From MaRDI portal
Publication:378771
DOI10.1007/S10479-012-1126-1zbMath1274.90162OpenAlexW2031200311MaRDI QIDQ378771
Ronald Woodaman, Kellen Leister, Daniel Stimpson, Peter Kolesar
Publication date: 12 November 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1126-1
Related Items (3)
Combining regression and mixed-integer programming to model counterinsurgency ⋮ A reinforcement learning approach to convoy scheduling on a contested transportation network ⋮ Computational complexity of convoy movement planning problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- The vehicle routing problem. Latest advances and new challenges.
- Theory of optimal search
- The Truck Dispatching Problem
- Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem
- Models of sensor operations for border surveillance
This page was built for publication: A simple model of optimal clearance of improvised explosive devices