41 counterexamples to property (B) of the discrete time bomber problem

DOI10.1007/s10479-016-2265-6zbMath1357.90170DBLPjournals/anor/Kamihigashi17OpenAlexW2461360729WikidataQ59607021 ScholiaQ59607021MaRDI QIDQ513590

Takashi Kamihigashi

Publication date: 7 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2265-6

zbMATH Keywords

stochastic dynamic programmingdiscrete-time bomber problemerror-free methodsGNU multiple precision (GMP) arithmetic library

Mathematics Subject Classification ID

Optimal stochastic control (93E20) Markov and semi-Markov decision processes (90C40) Sequential statistical design (62L05)

Related Items (2)

Sequential attack salvo size is monotonic nondecreasing in both time and inventory level ⋮ A sequential partial information bomber‐defender shooting problem

Uses Software

• gmp
• Mathematica

Cites Work

• Unnamed Item
• ABCs of the bomber problem and its relatives
• The fighter problem: optimal allocation of a discrete commodity
• On optimal allocation of a continuous resource using an iterative approach and total positivity
• Some results on the bomber problem
• Generalized Bomber and Fighter Problems: Offline Optimal Allocation of a Discrete Asset
• On some problems in operations research

This page was built for publication: 41 counterexamples to property (B) of the discrete time bomber problem