A heuristic to generate rank-1 GMI cuts

No abstract is available for this paper.

• Publication year

  2010

• Venue

  Mathematical Programming Computation

• Publication date

  2010-11-16

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s12532-010-0018-0
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Operations Research Letters

  2011influential reference
• Two-Step MIR Inequalities for Mixed Integer Programs

  2010cited by this paper
• MIR closures of polyhedral sets

  2009influential reference
• Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants

  2009influential reference
• Numerically Safe Gomory Mixed-Integer Cuts

  2009influential reference
• Testing cut generators for mixed-integer linear programming

  2009cited by this paper
• Grid-Enabled Optimization with GAMS

  2009cited by this paper
• Optimizing over the split closure

  2008influential reference
• On the strength of Gomory mixed-integer cuts as group cuts

  2008influential reference
• On the exact separation of mixed integer knapsack cuts

  2007influential reference
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

  2005cited by this paper
• Combinatorial Algorithms for Computing Column Space Bases That Have Sparse Inverses

  2005cited by this paper
• Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts

  2005cited by this paper
• Mixed-Integer Cuts from Cyclic Groups

  2005influential reference
• Optimizing over the first Chvátal closure

  2005influential reference
• Mixed-Integer Programming: A Progress Report

  2004cited by this paper
• The Sharpest Cut (MPS-Siam Series on Optimization)

  2004cited by this paper
• Information on MIPLIB's timetab-instances

  2003cited by this paper
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming

  2003cited by this paper
• On the separation of split cuts and related inequalities

  2003cited by this paper
• Aggregation and Mixed Integer Rounding to Solve MIPs

  2001cited by this paper
• Elementary closures for integer programs

  2001cited by this paper
• MIP: Theory and Practice - Closing the Gap

  1999cited by this paper
• An Updated Mixed Integer Programming Library: MIPLIB 3.0

  1998cited by this paper
• Gomory cuts revisited

  1996influential reference
• Combining and Strengthening Gomory Cuts

  1995cited by this paper
• A lift-and-project cutting plane algorithm for mixed 0–1 programs

  1993cited by this paper
• Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases

  1990influential reference
• Integer and Combinatorial Optimization

  1988cited by this paper
• Multicommodity Distribution System Design by Benders Decomposition

  1974cited by this paper
• Matroids and the greedy algorithm

  1971cited by this paper
• AN ALGORITHM FOR THE MIXED INTEGER PROBLEM

  1960cited by this paper
• The Elimination form of the Inverse and its Application to Linear Programming

  1957cited by this paper
• Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003

  year unknowncited by this paper

• Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program

  2024cites this paper
• Last fifty years of integer linear programming: A focus on recent practical advances

  2024cites this paper
• Lattice Reformulation Cuts

  2021cites this paper
• LATTICE REFORMULATIONS CUTS

  2018cites this paper
• Theoretical challenges towards cutting-plane selection

  2018cites this paper
• Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse

  2017influential citation
• On the relative strength of different generalizations of split cuts

  2015cites this paper
• Virtual private network design over the first Chvátal closure

  2015influential citation
• Characterization of the split closure via geometric lifting

  2015cites this paper
• Separation of Generic Cutting Planes in Branch-and-Price Using a Basis

  2015cites this paper
• The strength of multi-row models

  2014cites this paper
• Approximating the Split Closure

  2013cites this paper
• Split Cuts for Stochastic Integer Programming

  2013cites this paper
• Understanding the Strength of General-Purpose Cutting Planes

  2013cites this paper
• Valid Linear Programming Bounds for Exact Mixed-Integer Programming

  2013cites this paper
• The stable set problem: some structural properties and relaxations

  2012cites this paper
• How tight is the corner relaxation? Insights gained from the stable set problem

  2012cites this paper
• A computational study of the cutting plane tree algorithm for general mixed-integer linear programs

  2012cites this paper
• A relax-and-cut framework for Gomory mixed-integer cuts

  2011influential citation
• Corner Polyhedron and Intersection Cuts

  2011cites this paper
• How tight is the corner relaxation?

  2011cites this paper
• Generating general-purpose cutting planes for mixed-integer programs

  2010cites this paper
• A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts

  2010influential citation
• Topics in exact precision mathematical programming

  2010cites this paper
• On optimizing over lift-and-project closures

  2010influential citation
• Submitted to Informs Journal on Computing Manuscript (please, Provide the Mansucript Number!) Computational Experiments with Cross and Crooked Cross Cuts

  year unknowncites this paper