Cutting planes for integer programs with general integer variables
type: Item
instance of: scholarly article
title: Cutting planes for integer programs with general integer variables
zbMATH Open document ID: 0919.90113
DOI: 10.1007/BF01581105
author: Sebastián Ceria
author: Cécile Cordier
author: Hugues Marchand
author: Laurence A. Wolsey
published in: Mathematical Programming. Series A. Series B
publication date: 1999-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1294670
zbMATH Keywords: integer programming
zbMATH Keywords: cutting planes
zbMATH Keywords: cover inequalities
zbMATH Keywords: lifting
zbMATH Keywords: Gomory mixed integer cuts
zbMATH Keywords: cut-and-branch
zbMATH Keywords: knapsack inequalities
zbMATH Keywords: branch-and-bound
describes a project that uses: MIPLIB
describes a project that uses: CPLEX
MaRDI profile type: Publication
cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Shortest paths, single origin‐destination network design, and associated polyhedra
cites work: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs
cites work: On the facial structure of set packing polyhedra
cites work: Technical Note—Facets and Strong Valid Inequalities for Integer Programs
cites work: Gomory cuts revisited
cites work: Q3137910
cites work: On the \(0/1\) knapsack polytope
full work available at URL: https://doi.org/10.1007/bf01581105
OpenAlex ID: W2046300504
description: scientific article; zbMATH DE number 1294670