13 problems
- 0 votes0 replies0 views
The conjecture on objective alignment and the effectiveness of MILP cuts
Consider mixed-integer bilevel linear optimization instances classified by their objective alignment, and compare cut-generation performance with and without mixed-integer linear p…
- 0 votes0 replies0 views
The conjecture that cut-generation failure is low at objective alignment -1
Consider mixed-integer bilevel linear optimization instances with an objective-alignment parameter, and let the cut-generation failure rate denote the proportion of attempted inter…
- 0 votes0 replies0 views
The conjecture that MILP cuts reduce cut-generation failures
Mixed-integer bilevel linear optimization problems may use intersection cuts (ICs), including integer disjunctive intersection cuts and integer split intersection cuts, together wi…
- 0 votes0 replies2 views
The conjecture on the causes of the smaller exact-setting speedup
Conjecture on the speedup difference. These two features are the reasons for the smaller speedup in the exact setting.
- 0 votes0 replies0 views
Conjecture that NFP-CM-VS provides a tighter formulation than NFP-CM-VS2
The NFP-CM-VS and NFP-CM-VS2 formulations are mixed-integer programming models for irregular strip packing, with NFP-CM-VS2 being more compact than NFP-CM-VS. NFP-CM-VS tightening…
- 0 votes0 replies0 views
Conjecture on high-dimensional faces from evolved cutting-plane techniques
The face dimension of a cut is the dimension of the face it induces in the feasible region of a mixed-integer linear program; empirically, face dimensions are often concentrated ne…
- 0 votes0 replies0 views
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, t…
- 0 votes0 replies1 view
Conjecture on CPLEX exploiting formulation structure in mixed integer reformulations
CPLEX structure-exploitation conjecture. We conjecture that this favorable outcome can be attributed to CPLEX's capability of identifying the particular structure of this formulati…
- 0 votes0 replies0 views
Existence of conic mixed-integer programs with a feasible subadditive dual and infeasible continuous conic dual
Existence conjecture. There exist conic mixed-integer programs whose subadditive dual is feasible but whose conic dual of the continuous relaxation is infeasible.
- 0 votes0 replies0 views
Che–Qi–Wei conjecture on uniqueness for positive definite diagonal tensors
Let be a diagonal tensor, let , and consider the tensor complementarity problem : find…
- 0 votes0 replies0 views
Delta-only distance conjecture for optimal mixed-integer program solutions
Let be the constraint matrix, let be the largest absolute value of any determinant of a square submatrix of , and let index the variables required…
- 0 votes0 replies0 views
Polynomial-size exact MIP reformulation for pre-disaster planning on low-pathwidth line graphs
Let be the underlying graph, and let its line graph have pathwidth bounded by . The pre-disaster planning reformulation conjecture. The pr…
- 0 votes0 replies0 views
Polyhedrality of the generalized triangle closure
Let , where and . Its mixed integer hull is … For eve…