Strengthening lattice-free cuts using non-negativity

DOI10.1016/J.DISOPT.2010.09.002zbMath1245.90069OpenAlexW2070134421MaRDI QIDQ429683

Oktay Günlük, Ricardo Fukasawa

Publication date: 20 June 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2010.09.002

zbMATH Keywords

valid inequalitieslattice-free polyhedra

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (9)

Tight bounds on discrete quantitative Helly numbers ⋮ Intersection cuts for single row corner relaxations ⋮ Intersection Disjunctions for Reverse Convex Sets ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ An algorithm for the separation of two-row cuts ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra ⋮ The strength of multi-row models

Cites Work

• Unnamed Item
• Unnamed Item
• On degenerate multi-row Gomory cuts
• Diophantine approximation
• On a generalization of the master cyclic group polyhedron
• On the facets of mixed integer programs with two integer variables and two constraints
• Some polyhedra related to combinatorial problems
• Convexity in cristallographical lattices
• Mixed-integer sets from two rows of two adjacent simplex bases
• Constrained Infinite Group Relaxations of MIPs
• Minimal Inequalities for an Infinite Relaxation of Integer Programs
• Minimal Valid Inequalities for Integer Constraints
• Computing with Multi-row Gomory Cuts
• An observation on the structure of production sets with indivisibilities
• A Theorem Concerning the Integer Lattice
• Inequalities from Two Rows of a Simplex Tableau
• Convex Analysis

This page was built for publication: Strengthening lattice-free cuts using non-negativity