On the enumerative nature of Gomory's dual cutting plane method
type: Item
instance of: scholarly article
title: On the enumerative nature of Gomory's dual cutting plane method
zbMATH Open document ID: 1201.90135
author: E. Balas
author: Matteo Fischetti
author: Arrigo Zanette
published in: Mathematical Programming. Series A. Series B
publication date: 2010-11-22T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C49
zbMATH DE Number: 5818060
zbMATH Keywords: cutting plane methods
zbMATH Keywords: Gomory cuts
zbMATH Keywords: degeneracy in linear programming
zbMATH Keywords: lexicographic dual simplex
zbMATH Keywords: computational analysis
describes a project that uses: PAGP
describes a project that uses: MIPLIB2003
describes a project that uses: MIPLIB
MaRDI profile type: Publication
full work available at URL: s10107-010-0392-4
OpenAlex ID: W1999589612
cites work: PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems
cites work: Optimizing over the split closure
cites work: Duality Theory of Linear Programs: A Constructive Approach with Applications
cites work: Modern multidimensional scaling. Theory and applications.
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: Chvátal closures for mixed integer programming problems
cites work: MIR closures of polyhedral sets
cites work: Optimizing over the first Chvátal closure
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: Integer Programming and Pricing
cites work: Q5645210
cites work: An upper bound on the number of cuts needed in Gomory's method of integer forms
cites work: A review of goal programming and its applications
cites work: Lexicography and degeneracy: Can a pure cutting plane algorithm work?
DOI: 10.1007/S10107-010-0392-4
description: scientific article; zbMATH DE number 5818060