On efficient algorithms for finding efficient salvo policies

DOI10.1002/nav.21891zbMath1523.90269OpenAlexW3004822340WikidataQ115150506 ScholiaQ115150506MaRDI QIDQ6046641

Martijn van Ee

Publication date: 5 October 2023

Published in: Naval Research Logistics (NRL) (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)

Related Items (1)

Time-critical testing and search problems

Cites Work

• Unnamed Item
• Approximation and complexity of multi-target graph search and the Canadian traveler problem
• Integer convex minimization by mixed integer linear optimization
• The Cooperative Ballistic Missile Defence Game
• On efficient salvo policies
• Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
• Reducibility among Combinatorial Problems

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