On efficient algorithms for finding efficient salvo policies

DOI10.1002/NAV.21891MaRDI QIDQ6046641zbMATH OpenOpenAlexWikidataFDO

Authors Martijn van Ee

Publication date 5 October 2023

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.21891

zbMATH Keywords

computational complexitydynamic programmingapproximation schemecombat modelingsalvo policy

Mathematics Subject Classification ID

Special processes (60K99) Operations research and management science (90B99)

Recommendations

• On efficient salvo policies
• Effective attacks in the salvo combat model: Salvo sizes and quantities of targets
• Generalized Bomber and Fighter Problems: Offline Optimal Allocation of a Discrete Asset
• Approximate dynamic programming for missile defense interceptor fire control
• An approximate dynamic programming approach for comparing firing policies in a networked air defense environment

Cites work

• scientific article; zbMATH DE number 3059214 (Why is no real title available?)
• Approximation and complexity of multi-target graph search and the Canadian traveler problem
• Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
• Integer convex minimization by mixed integer linear optimization
• On efficient salvo policies
• Reducibility among combinatorial problems
• The cooperative ballistic missile defence game

Cited in

(4)

• On efficient salvo policies
• Effective attacks in the salvo combat model: Salvo sizes and quantities of targets
• Time-critical testing and search problems
• Sequential attack salvo size is monotonic nondecreasing in both time and inventory level

This page was built for publication: On efficient algorithms for finding efficient salvo policies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046641)