Computational Experiments with Cross and Crooked Cross Cuts
From MaRDI portal
Publication:2940067
DOI10.1287/ijoc.2014.0598zbMath1304.90225OpenAlexW2100782434MaRDI QIDQ2940067
Juan Pablo Vielma, Sanjeeb Dash, Oktay Günlük
Publication date: 26 January 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/99206
Related Items (8)
Theoretical challenges towards cutting-plane selection ⋮ Partial hyperplane activation for generalized intersection cuts ⋮ Cut generation through binarization ⋮ Lift-and-project cuts for convex mixed integer nonlinear programs ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ The strength of multi-row models ⋮ When Lift-and-Project Cuts Are Different
Uses Software
Cites Work
- Unnamed Item
- On mixed-integer sets with two integer variables
- Strengthening lattice-free cuts using non-negativity
- On the exact separation of mixed integer knapsack cuts
- On the separation of disjunctive cuts
- A heuristic to generate rank-1 GMI cuts
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- MIR closures of polyhedral sets
- Mixed-integer cuts from cyclic groups
- Chvátal closures for mixed integer programming problems
- On the strength of Gomory mixed-integer cuts as group cuts
- Cook, Kannan and Schrijver's example revisited
- On the complexity of cutting-plane proofs using split cuts
- Computing with multi-row gomory cuts
- Equivalence between intersection cuts and the corner polyhedron
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- On the relative strength of different generalizations of split cuts
- A relax-and-cut framework for Gomory mixed-integer cuts
- On optimizing over lift-and-project closures
- An algorithm for the separation of two-row cuts
- Optimizing over the split closure
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Gomory cuts revisited
- Valid inequalities based on simple mixed-integer sets
- Two row mixed-integer cuts via lifting
- Experiments with Two-Row Cuts from Degenerate Tableaux
- Constrained Infinite Group Relaxations of MIPs
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- A Geometric Perspective on Lifting
- Minimal Valid Inequalities for Integer Constraints
- Experiments with Two Row Tableau Cuts
- Disjunctive Programming
- Inequalities from Two Rows of a Simplex Tableau
This page was built for publication: Computational Experiments with Cross and Crooked Cross Cuts
