A Proof of the Bomber Problem's Spend-It-All Conjecture (Q3083471): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123022908, #quickstatements; #temporary_batch_1704735187142 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963642930 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1103.0309 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On optimal allocation of a continuous resource using an iterative approach and total positivity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Spend-It-All Region and Small Time Results for the Continuous Bomber Problem / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:10, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Proof of the Bomber Problem's Spend-It-All Conjecture |
scientific article |
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
