On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
From MaRDI portal
Publication:2340339
Recommendations
- On the relative strength of split, triangle and quadrilateral cuts
- On the relative strength of split, triangle and quadrilateral cuts
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
- On an analysis of the strength of mixed-integer cutting planes from multiple simplex tableau rows
- scientific article; zbMATH DE number 2086918
Cites work
- A probabilistic analysis of the strength of the split and triangle closures
- A probabilistic comparison of split and type 1 triangle cuts for two-row mixed-integer programs
- An algorithm for the separation of two-row cuts
- On the existence of optimal solutions to integer and mixed-integer programming problems
Cited in
(7)- Theoretical challenges towards cutting-plane selection
- On the practical strength of two-row tableau cuts
- On the polyhedrality of cross and quadrilateral closures
- On an analysis of the strength of mixed-integer cutting planes from multiple simplex tableau rows
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
- On the relative strength of split, triangle and quadrilateral cuts
- Approximation of corner polyhedra with families of intersection cuts
This page was built for publication: On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340339)