Lower-bound conjecture for the optimal cleanup threshold
Statement
Let be the value of minimizing the long-run average search-plus-cleanup cost, and let minimize the corresponding approximate cost in the complete-memory, numbered-shelves model .
Approximate-threshold conjecture. We have
The approximate problem is analyzed explicitly, with lying near . The conjecture asserts that this computable approximate threshold is a lower bound for the true optimal threshold; the paper reports numerical support, but no proof is given.
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.