Closed oscarsuen closed 3 weeks ago
Instead of computing $U_N^k(p)$ symbolically, we can add v(i,j) variables to the model and declaritively program in the constraint for the formula
v(i,j)
$$Vn(p) = \min{1\leq k\leq n} U_n^k(p)$$
It might even be worth adding $u(i,j,k)$ variables.
Implemented in 1b3401d. Doesn't seem to speed up $N=6$ and doesn't solve $N=7$ in a reasonable time.
Instead of computing $U_N^k(p)$ symbolically, we can add
v(i,j)
variables to the model and declaritively program in the constraint for the formula$$Vn(p) = \min{1\leq k\leq n} U_n^k(p)$$
It might even be worth adding $u(i,j,k)$ variables.