Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
From MaRDI portal
Publication:2103047
DOI10.1016/j.ejor.2022.06.031OpenAlexW4283163786MaRDI QIDQ2103047
Matthew J. Robbins, Joseph M. Liles, Brian J. Lunday
Publication date: 12 December 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.06.031
Markov decision processdynamic assignment problemapproximate dynamic programmingOR in defenseair battle management
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate dynamic programming for the dispatch of military medical evacuation assets
- Quadratic assignment problems
- False targets efficiency in defense strategy
- A survey of algorithms for the generalized assignment problem
- The \(\beta\)-assignment problems
- The bottleneck generalized assignment problem
- Stochastic conditional and unconditional warfare
- Approximate dynamic programming for missile defense interceptor fire control
- Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
- Approximate dynamic programming for the military aeromedical evacuation dispatching, preemption-rerouting, and redeployment problem
- Approximate dynamic programming for the military inventory routing problem
- An approximate dynamic programming approach for comparing firing policies in a networked air defense environment
- Modeling and solving a crew assignment problem in air transportation
- The Quadratic Assignment Problem
- ACTIVE AND PASSIVE DEFENSE AGAINST MULTIPLE ATTACK FACILITIES
- A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
- Governments' and Terrorists' Defense and Attack in a T-Period Game
- Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies
This page was built for publication: Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming