On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
From MaRDI portal
Publication:2340339
DOI10.1007/s10107-014-0775-zzbMath1309.90061MaRDI QIDQ2340339
Yogesh Awate, Guenin, Bertrand, Cornuéjols, Gérard, Tunçel, Levent
Publication date: 16 April 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-014-0775-z
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
90C10: Integer programming
90C11: Mixed integer programming
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
Related Items
Approximation of Corner Polyhedra with Families of Intersection Cuts, On the polyhedrality of cross and quadrilateral closures, Theoretical challenges towards cutting-plane selection
Cites Work
- An algorithm for the separation of two-row cuts
- 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
- On the existence of optimal solutions to integer and mixed-integer programming problems