Asymptotic conjecture for the optimal cleanup threshold
Statement
Let be the number of objects and let denote the value of minimizing the long-run average search-plus-cleanup cost in the complete-memory, numbered-shelves model . Write .
Optimal cleanup threshold conjecture. For , we have
and, asymptotically,
The paper establishes the corresponding upper bound and proves the sharper bounds for the approximate optimization problem. The lower bound and the asymptotic behavior for the original problem are supported by numerical evidence but remain conjectural.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.