Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Split closure and intersection cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities from Two Rows of a Simplex Tableau / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finitely generated closures in the theory of cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized intersection cuts and a new cut generating paradigm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the split closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relative strength of split, triangle and quadrilateral cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lifting Integer Variables in Minimal Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique lifting of integer variables in minimal inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Lattice-Free Convex Sets in Linear Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Inequalities for an Infinite Relaxation of Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique Minimal Liftings for Simplicial Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts with Infinite Split Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Probabilistic Analysis of the Strength of the Split and Triangle Closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Sets and Minimal Sublinear Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem Concerning the Integer Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing convex hulls with a linear solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation of split cuts and related inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between intersection cuts and the corner polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Approaches to Mixed Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Perspective on Lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming and relaxations of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal closures for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rank of mixed 0,1 polyhedra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of cutting-plane proofs using split cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mixed-integer sets with two integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the MIR Closure of Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIR closures of polyhedral sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the MIR closure and basic relaxations of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experiments with Cross and Crooked Cross Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rank of Disjunctive Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations of mixed integer sets from lattice-free polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the split rank of intersection cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split Rank of Triangle and Quadrilateral Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two row mixed-integer cuts via lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening lattice-free cuts using non-negativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case comparison of valid inequalities for the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of optimal solutions to integer and mixed-integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximal <i>S</i>-Free Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projecting Lattice Polytopes Without Interior Lattice Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A disjunctive cutting plane procedure for general mixed-integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Sequences of Convex Sets in Finite Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An observation on the structure of production sets with indivisibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive characterization of the split closure of a mixed integer linear program / rank
 
Normal rank

Latest revision as of 08:40, 12 July 2024

scientific article; zbMATH DE number 6605535
Language Label Description Also known as
English
Relaxations of mixed integer sets from lattice-free polyhedra
scientific article; zbMATH DE number 6605535

    Statements

    Relaxations of mixed integer sets from lattice-free polyhedra (English)
    0 references
    0 references
    0 references
    22 July 2016
    0 references
    0 references
    mixed integer programming
    0 references
    cutting planes
    0 references
    disjunctive programming
    0 references
    lattice-free polyhedra
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references