Generalized Bomber and Fighter Problems: Offline Optimal Allocation of a Discrete Asset

DOI10.1239/JAP/1371648949MaRDI QIDQ5299565zbMATH OpenOpenAlexFDO

Authors Abba M. Krieger, Ester Samuel-Cahn

Publication date 26 June 2013

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.jap/1371648949

zbMATH Keywords

dynamic allocationfrail fighterhazard rate dominanceinvincible fighterlikelihood ratio dominanceoptimality properties

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Sequential statistical methods (62L99) Continuous location (90B85) Applications of game theory (91A80)

Recommendations

• The fighter problem: optimal allocation of a discrete commodity
• The discrete search problem and the construction of optimal allocations
• Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
• scientific article; zbMATH DE number 1560349
• Optimal multi-stage allocation of weapons to targets using adaptive dynamic programming
• General solution to many-on-many heterogeneous stochastic combat
• scientific article; zbMATH DE number 4074952
• The Spend-It-All Region and Small Time Results for the Continuous Bomber Problem
• A game theoretical multiple resource interaction approach to resource allocation in an air campaign

Cites work

• ABCs of the bomber problem and its relatives
• scientific article; zbMATH DE number 3863589 (Why is no real title available?)
• scientific article; zbMATH DE number 605729 (Why is no real title available?)
• scientific article; zbMATH DE number 3405656 (Why is no real title available?)
• On a problem of ammunition rationing
• On optimal allocation of a continuous resource using an iterative approach and total positivity
• On some problems in operations research
• Some results on the bomber problem
• The fighter problem: optimal allocation of a discrete commodity

Cited in

(9)

• Towards the real time solution of strike force asset allocation problems
• The fighter problem: optimal allocation of a discrete commodity
• On optimal allocation of a continuous resource using an iterative approach and total positivity
• A proof of the Bomber problem's spend-it-all conjecture
• ABCs of the bomber problem and its relatives
• The Spend-It-All Region and Small Time Results for the Continuous Bomber Problem
• 41 counterexamples to property (B) of the discrete time bomber problem
• On efficient algorithms for finding efficient salvo policies
• A sequential partial information bomber‐defender shooting problem

This page was built for publication: Generalized Bomber and Fighter Problems: Offline Optimal Allocation of a Discrete Asset

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