The MVB conjecture on asymptotically optimal branching variables
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.
References
- Daniel Anderson, Pierre Le Bodic and Kerri Morgan, “Further Results on an Abstract Model for Branching and its Application to Mixed-Integer Programming”, arXiv:1909.01472 (2020).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.