A relax-and-cut framework for Gomory mixed-integer cuts
type: Item
instance of: scholarly article
title: A relax-and-cut framework for Gomory mixed-integer cuts
zbMATH Open document ID: 1257.90057
author: Matteo Fischetti
author: Domenico Salvagnin
published in: Mathematical Programming Computation
publication date: 2012-11-27T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C49
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6110464
zbMATH Keywords: Gomory cuts
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: relax-and-cut
describes a project that uses: Cgllandp
describes a project that uses: MIPLIB
describes a project that uses: COIN-OR
describes a project that uses: SCIP
describes a project that uses: FEASPUMP
describes a project that uses: MIPLIB2003
MaRDI profile type: Publication
full work available at URL: s12532-011-0024-x
OpenAlex ID: W1990925151
cites work: SCIP: solving constraint integer programs
cites work: Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
cites work: Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
cites work: Gomory cuts revisited
cites work: Strengthening cuts for mixed integer programs
cites work: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
cites work: Optimizing over the split closure
cites work: Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
cites work: A Heuristic Method for the Set Covering Problem
cites work: Revival of the Gomory cuts in the 1990's
cites work: Valid inequalities for mixed integer linear programs
cites work: Elementary closures for integer programs.
cites work: A heuristic to generate rank-1 GMI cuts
cites work: MIR closures of polyhedral sets
cites work: A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
cites work: Optimizing over the first Chvátal closure
cites work: Feasibility pump 2.0
cites work: Integer Programming and Pricing
cites work: Information-based branching schemes for binary linear mixed integer problems
cites work: Non delayed relax-and-cut algorithms
cites work: Q5294045
cites work: On the capacitated vehicle routing problem
cites work: Lexicography and degeneracy: Can a pure cutting plane algorithm work?
DOI: 10.1007/S12532-011-0024-X
description: scientific article; zbMATH DE number 6110464