scientific article; zbMATH DE number 4119933
From MaRDI portal
zbMATH Open0683.90054MaRDI QIDQ4733665FDOQ4733665
Authors: László Lovász 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Diophantine equations (11D99)
Cited In (61)
- Mixed-integer linear representability, disjunctions, and Chvátal functions -- modeling implications
- Lattice reduced and complete convex bodies
- Difference between families of weakly and strongly maximal integral lattice-free polytopes
- The triangle closure is a polyhedron
- Unique lifting of integer variables in minimal inequalities
- Title not available (Why is that?)
- Computing with multi-row gomory cuts
- Poisson approximation and Weibull asymptotics in the geometry of numbers
- Constructing lattice-free gradient polyhedra in dimension two
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- Maximal \(S\)-free convex sets and the Helly number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strengthening lattice-free cuts using non-negativity
- Complexity of linear relaxations in integer programming
- Approximation of corner polyhedra with families of intersection cuts
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- Theoretical challenges towards cutting-plane selection
- The Empty Sphere
- Title not available (Why is that?)
- Enumerating projections of integer points in unbounded polyhedra
- A local maximizer for lattice width of 3-dimensional hollow bodies
- The topological structure of maximal lattice free convex bodies: The general case
- Certificates of linear mixed integer infeasibility
- Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results
- Sublinear bounds for a quantitative Doignon-Bell-Scarf theorem
- On the relative strength of split, triangle and quadrilateral cuts
- Mixed-integer convex representability
- Design and verify: a new scheme for generating cutting-planes
- Tight bounds on discrete quantitative Helly numbers
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Lifting properties of maximal lattice-free polyhedra
- Reverse split rank
- Two row mixed-integer cuts via lifting
- Title not available (Why is that?)
- Mixed-integer sets from two rows of two adjacent simplex bases
- A geometric approach to cut-generating functions
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
- Relaxations of mixed integer sets from lattice-free polyhedra
- Title not available (Why is that?)
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- The covering radius and a discrete surface area for non-hollow simplices
- Helly’s theorem: New variations and applications
- Title not available (Why is that?)
- Closedness of integer hulls of simple conic sets
- Equivalence between intersection cuts and the corner polyhedron
- Minkowski's Convex Body Theorem and Integer Programming
- Integer programming and algorithmic geometry of numbers
- On a problem in the geometry of numbers
- Some properties of convex hulls of integer points contained in general convex sets
- Intersection cuts for single row corner relaxations
- Computing with Multi-row Gomory Cuts
- Towards a characterization of maximal quadratic-free sets
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
- An algorithm for the separation of two-row cuts
- On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
- Lattice closures of polyhedra
- On finitely generated closures in the theory of cutting planes
- Generalized intersection cuts and a new cut generating paradigm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733665)
