Approximation of Corner Polyhedra with Families of Intersection Cuts
From MaRDI portal
Publication:4637498
DOI10.1137/17M1128939zbMath1395.90184OpenAlexW2794912356WikidataQ130064193 ScholiaQ130064193MaRDI QIDQ4637498
Gennadiy Averkov, Joseph Paat, Amitabh Basu
Publication date: 24 April 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1128939
Related Items
Lattice-free simplices with lattice width \(2d - o(d)\), Lattice closures of polyhedra, Towards a characterization of maximal quadratic-free sets
Cites Work
- Unnamed Item
- Unnamed Item
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- On the relative strength of split, triangle and quadrilateral cuts
- On degenerate multi-row Gomory cuts
- A proof of Lovász's theorem on maximal lattice-free sets
- On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
- A geometric approach to cut-generating functions
- Some polyhedra related to combinatorial problems
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Integer Programming
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three
- Cut-Generating Functions
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- Convex Bodies The Brunn-MinkowskiTheory
- Inequalities from Two Rows of a Simplex Tableau
- Convex Analysis
