A proof of the Bomber problem's spend-it-all conjecture (Q3083471)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5868869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A proof of the Bomber problem's spend-it-all conjecture |
scientific article; zbMATH DE number 5868869 |
Statements
A Proof of the Bomber Problem's Spend-It-All Conjecture (English)
0 references
21 March 2011
0 references
ammunition rationing
0 references
optimal allocation
0 references
Poisson process
0 references
sequential optimization
0 references
0.9413853883743286
0 references
0.8569104671478271
0 references
0.8538158535957336
0 references
0.789204478263855
0 references
0.7820287942886353
0 references
