Publication:4733665
From MaRDI portal
zbMath0683.90054MaRDI QIDQ4733665
Publication date: 1989
68Q25: Analysis of algorithms and problem complexity
90C10: Integer programming
90C27: Combinatorial optimization
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
11D99: Diophantine equations
Related Items
Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem, Approximation of Corner Polyhedra with Families of Intersection Cuts, Enumerating Projections of Integer Points in Unbounded Polyhedra, On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width, Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications, On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints, Relaxations of mixed integer sets from lattice-free polyhedra, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, Some properties of convex hulls of integer points contained in general convex sets, Unique lifting of integer variables in minimal inequalities, Strengthening lattice-free cuts using non-negativity, A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts, On the relative strength of split, triangle and quadrilateral cuts, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, Lifting properties of maximal lattice-free polyhedra, Reverse split rank, Computing with multi-row gomory cuts, Equivalence between intersection cuts and the corner polyhedron, The topological structure of maximal lattice free convex bodies: The general case, Intersection cuts for single row corner relaxations, Theoretical challenges towards cutting-plane selection, On finitely generated closures in the theory of cutting planes, Generalized intersection cuts and a new cut generating paradigm, A local maximizer for lattice width of 3-dimensional hollow bodies, The covering radius and a discrete surface area for non-hollow simplices, Lattice closures of polyhedra, The triangle closure is a polyhedron, Design and verify: a new scheme for generating cutting-planes, Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming, A geometric approach to cut-generating functions, Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results, Tight bounds on discrete quantitative Helly numbers, Unbounded convex sets for non-convex mixed-integer quadratic programming, An algorithm for the separation of two-row cuts, Certificates of linear mixed integer infeasibility, Two row mixed-integer cuts via lifting, Mixed-integer sets from two rows of two adjacent simplex bases, Maximal $S$-Free Convex Sets and the Helly Number, Helly’s theorem: New variations and applications, Closedness of Integer Hulls of Simple Conic Sets, Computing with Multi-row Gomory Cuts
