The MVB conjecture on asymptotically optimal branching variables
Statement
An MVB instance consists of variables , with recurrence
Its variable ratios are denoted by . The MVB conjecture. For each instance of MVB, there exists a gap such that for all gaps greater than , variable is always optimal to branch on at the root node. The conjecture was introduced after the result that the MVB ratio is . It is false in general, as shown in this paper.
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.