ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An MVB instance consists of variables (li,ri)1≤i≤n(l_i,r_i)_{1\leq i\leq n}, with recurrence

t(G)={1if⁡G≤0,1+min⁡1≤i≤n(t(G−li)+t(G−ri))if⁡G>0.t(G)=\begin{cases}1&\operatorname{if }G\leq 0,\\1+\min\limits_{1\leq i\leq n}\bigl(t(G-l_i)+t(G-r_i)\bigr)&\operatorname{if }G>0.\end{cases}

Its variable ratios are denoted by φi\varphi_i. The MVB conjecture. For each instance of MVB, there exists a gap HH such that for all gaps greater than HH, variable i=arg min⁡jφji=\operatorname*{arg\,min}_j\varphi_j is always optimal to branch on at the root node. The conjecture was introduced after the result that the MVB ratio is φ=min⁡1≤i≤nφi\varphi=\min_{1\leq i\leq n}\varphi_i. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.