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