A maximum expected covering problem for locating and dispatching two classes of military medical evacuation air assets

DOI10.1007/s11590-014-0819-6zbMath1329.90060OpenAlexW1978115209MaRDI QIDQ895761

Laura A. McLay, Nathaniel D. Bastian, Benjamin C. Grannan

Publication date: 4 December 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0819-6

zbMATH Keywords

binary linear programmingair MEDEVAC asset managementcasualty triagemilitary medicinespatial queuing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Boolean programming (90C09)

Related Items (3)

Approximate dynamic programming for the dispatch of military medical evacuation assets ⋮ Examining military medical evacuation dispatching policies utilizing a Markov decision process model of a controlled queueing system ⋮ Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies

Cites Work

• A probabilistic FLEET model with individual vehicle reliability requirements
• The Maximal Expected Covering Location Problem: Revisited
• Approximating the Equilibrium Behavior of Multi-Server Loss Systems
• Police Patrol-Initiated Activities Within a Systems Queueing Model
• Approximating the Performance of Urban Emergency Service Systems
• Technical Note—Approximating Vehicle Dispatch Probabilities for Emergency Service Systems with Location-Specific Service Times and Multiple Units per Location
• Hierarchical location-allocation models for congested systems

This page was built for publication: A maximum expected covering problem for locating and dispatching two classes of military medical evacuation air assets