Strengthening lattice-free cuts using non-negativity
From MaRDI portal
Publication:429683
DOI10.1016/J.DISOPT.2010.09.002zbMATH Open1245.90069OpenAlexW2070134421MaRDI QIDQ429683FDOQ429683
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
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
- Title not available (Why is that?)
- Convex Analysis
- Diophantine approximation
- Some polyhedra related to combinatorial problems
- Constrained infinite group relaxations of MIPs
- Minimal inequalities for an infinite relaxation of integer programs
- Minimal valid inequalities for integer constraints
- Inequalities from Two Rows of a Simplex Tableau
- Convexity in cristallographical lattices
- On the facets of mixed integer programs with two integer variables and two constraints
- Title not available (Why is that?)
- Mixed-integer sets from two rows of two adjacent simplex bases
- On degenerate multi-row Gomory cuts
- On a generalization of the master cyclic group polyhedron
- Computing with Multi-row Gomory Cuts
- An observation on the structure of production sets with indivisibilities
- A Theorem Concerning the Integer Lattice
Cited In (9)
- The strength of multi-row models
- Tight bounds on discrete quantitative Helly numbers
- 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
- Computational experiments with cross and crooked cross cuts
- Intersection cuts for single row corner relaxations
- Intersection Disjunctions for Reverse Convex Sets
- An algorithm for the separation of two-row cuts
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)
