2 problems

The Gamma-bound dominance conjecture for integer D-optimality
Gamma-bound dominance conjecture. For $s-q\geq 1$ , we have
openbranch-and-bound integer-optimization optimal-design
0 responses
07
The MVB conjecture on asymptotically optimal branching variables
An MVB instance consists of variables $(l_i,r_i)_{1\leq i\leq n}$ , with recurrence … Its variable ratios are denoted by $\varphi_i$ . The MVB conjecture. For each instance of MVB, t…
solvedbranch-and-bound computational-complexity mixed-integer-programming
0 responses
04

The Gamma-bound dominance conjecture for integer D-optimality