Sequential attack salvo size is monotonic nondecreasing in both time and inventory level

DOI10.1002/NAV.21967zbMATH Open1527.91049OpenAlexW3116335266MaRDI QIDQ6076486FDOQ6076486

Authors: Kalyanam Krishnamoorthy, Jake Clarkson 

Publication date: 17 October 2023

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

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

Recommendations

• On efficient salvo policies
• Effective attacks in the salvo combat model: Salvo sizes and quantities of targets
• On efficient algorithms for finding efficient salvo policies
• Optimal Attack Against An Area Defense Protecting Many Targets
• Some results on the bomber problem

zbMATH Keywords

sequential decision makingweapon-target assignmentshoot-look-shoot

Mathematics Subject Classification ID

Decision theory (91B06) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• ABCs of the bomber problem and its relatives
• A SEQUENTIAL ALLOCATION PROBLEM WITH SEARCH COST WHERE THE SHOOT-LOOK -SHOOT POLICY IS EMPLOYED
• A STOCHASTIC SEQUENTIAL ALLOCATION PROBLEM WHERE THE RESOURCES CAN BE REPLENISHED
• 41 counterexamples to property (B) of the discrete time bomber problem
• Suboptimal decision rule for attacking targets of opportunity
• Human-Machine Collaborative Optimization via Apprenticeship Scheduling
• Decision rules for attacking targets of opportunity
• On Optimal Ammunition Usage When Hunting Fleeing Targets

This page was built for publication: Sequential attack salvo size is monotonic nondecreasing in both time and inventory level

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