On efficient algorithms for finding efficient salvo policies

DOI10.1002/NAV.21891zbMATH Open1523.90269OpenAlexW3004822340WikidataQ115150506 ScholiaQ115150506MaRDI QIDQ6046641FDOQ6046641

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)

Cites Work

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

Cited In (1)

• Time-critical testing and search problems

   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 👍 👎

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)