Strengthening lattice-free cuts using non-negativity

DOI10.1016/J.DISOPT.2010.09.002MaRDI QIDQ429683zbMATH OpenOpenAlexFDO

Authors Ricardo Fukasawa, Oktay Günlük

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)

Recommendations

• Lattice reformulation cuts
• Handling separable non-convexities using disjunctive cuts
• Lattices of cuts in graphs
• On a positive semidefinite relaxation of the cut polytope
• Lattice-valued representation of the cut-elimination theorem
• Efficient cuts in Lagrangean `relax-and-cut' schemes
• Sharpened lower bounds for cut elimination
• Strengthening Gomory Mixed-Integer Cuts
• Cutsets of Boolean lattices
• scientific article; zbMATH DE number 1722658

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 4119933 (Why is no real title available?)
• A Theorem Concerning the Integer Lattice
• An observation on the structure of production sets with indivisibilities
• Computing with Multi-row Gomory Cuts
• Constrained infinite group relaxations of MIPs
• Convex Analysis
• Convexity in cristallographical lattices
• Diophantine approximation
• Inequalities from Two Rows of a Simplex Tableau
• Minimal inequalities for an infinite relaxation of integer programs
• Minimal valid inequalities for integer constraints
• Mixed-integer sets from two rows of two adjacent simplex bases
• On a generalization of the master cyclic group polyhedron
• On degenerate multi-row Gomory cuts
• On the facets of mixed integer programs with two integer variables and two constraints
• Some polyhedra related to combinatorial problems

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429683)