Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
- 20 June 2022
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 305 (3) , 1435-1449
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programmingEuropean Journal of Operational Research, 2012
- False targets efficiency in defense strategyEuropean Journal of Operational Research, 2009
- Modeling and solving a Crew Assignment Problem in air transportationEuropean Journal of Operational Research, 2006
- Particle swarm optimization for task assignment problemMicroprocessors and Microsystems, 2002
- Stochastic conditional and unconditional warfareEuropean Journal of Operational Research, 2002
- The β-assignment problemsEuropean Journal of Operational Research, 1998
- The bottleneck generalized assignment problemEuropean Journal of Operational Research, 1995
- A survey of algorithms for the generalized assignment problemEuropean Journal of Operational Research, 1992
- Quadratic assignment problemsEuropean Journal of Operational Research, 1984
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955