2 problems
- 0 votes0 replies0 views
Longer-time-limit performance conjecture for partition-relaxation approaches
The experiments compare commercial solvers with deterministic and randomized partition-relaxation approaches for improving lower bounds and closing optimality gaps in convex disjun…
- 0 votes0 replies0 views
Strongest formulation conjecture for the refined unary floor-layout formulation
Let denote the floor-layout disjunction with lower bounds, and let be its eight-branch disjunction encoded by … Let denote the co…