Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161)

scientific article; zbMATH DE number 6605535

In more languages

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)

Annals of Operations Research

0 references

publication date

22 July 2016

0 references

full work available at URL

http://hdl.handle.net/20.500.11850/51191

0 references

zbMATH Keywords

mixed integer programming

0 references

cutting planes

0 references

disjunctive programming

0 references

lattice-free polyhedra

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Split closure and intersection cuts

0 references

An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets

0 references

Inequalities from Two Rows of a Simplex Tableau

0 references

On finitely generated closures in the theory of cutting planes

0 references

Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three

0 references

Intersection Cuts—A New Type of Cutting Planes for Integer Programming

0 references

Disjunctive programming: Properties of the convex hull of feasible points

0 references

Disjunctive Programming

0 references

Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems

0 references

A lift-and-project cutting plane algorithm for mixed 0-1 programs

0 references

Generalized intersection cuts and a new cut generating paradigm

0 references

Optimizing over the split closure

0 references

On the relative strength of split, triangle and quadrilateral cuts

0 references

On Lifting Integer Variables in Minimal Inequalities

0 references

Unique lifting of integer variables in minimal inequalities

0 references

Maximal Lattice-Free Convex Sets in Linear Subspaces

0 references

Minimal Inequalities for an Infinite Relaxation of Integer Programs

0 references

Unique Minimal Liftings for Simplicial Polytopes

0 references

Intersection Cuts with Infinite Split Rank

0 references

A Probabilistic Analysis of the Strength of the Split and Triangle Closures

0 references

Convex Sets and Minimal Sublinear Functions

0 references

ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS

0 references

A Theorem Concerning the Integer Lattice

0 references

Computing convex hulls with a linear solver

0 references

On the separation of split cuts and related inequalities

0 references

Edmonds polytopes and a hierarchy of combinatorial problems

0 references

Equivalence between intersection cuts and the corner polyhedron

0 references

Polyhedral Approaches to Mixed Integer Linear Programming

0 references

A Geometric Perspective on Lifting

0 references

Disjunctive programming and relaxations of polyhedra

0 references

Chvátal closures for mixed integer programming problems

0 references

On the rank of mixed 0,1 polyhedra.

0 references

On the complexity of cutting-plane proofs using split cuts

0 references

On mixed-integer sets with two integer variables

0 references

Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra

0 references

Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming

0 references

On the MIR Closure of Polyhedra

0 references

MIR closures of polyhedral sets

0 references

A note on the MIR closure and basic relaxations of polyhedra

0 references

Computational Experiments with Cross and Crooked Cross Cuts

0 references

On the Rank of Disjunctive Cuts

0 references

A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts

0 references

On convergence in mixed integer programming

0 references

Relaxations of mixed integer sets from lattice-free polyhedra

0 references

A note on the split rank of intersection cuts

0 references

Split Rank of Triangle and Quadrilateral Inequalities

0 references

Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles

0 references

Two row mixed-integer cuts via lifting

0 references

Strengthening lattice-free cuts using non-negativity

0 references

Worst-case comparison of valid inequalities for the TSP

0 references

Q5645210

0 references

Some polyhedra related to combinatorial problems

0 references

Polynomial algorithms in linear programming

0 references

Q4733665

0 references

Aggregation and Mixed Integer Rounding to Solve MIPs

0 references

On the existence of optimal solutions to integer and mixed-integer programming problems

0 references

On Maximal <i>S</i>-Free Convex Sets

0 references

A recursive procedure to generate all cuts for 0-1 mixed integer programs

0 references

Projecting Lattice Polytopes Without Interior Lattice Points

0 references

A disjunctive cutting plane procedure for general mixed-integer linear programs

0 references

Q4235027

0 references

On the Convergence of Sequences of Convex Sets in Finite Dimensions

0 references

An observation on the structure of production sets with indivisibilities

A constructive characterization of the split closure of a mixed integer linear program

0 references

Identifiers

zbMATH Open document ID

1342.90110

0 references

DOI

10.1007/s10479-015-2024-0

0 references

Mathematics Subject Classification ID

Sitelinks

Mathematics(1 entry)

mardi Publication:5925161