A simple finite cutting plane algorithm for integer programs
type: Item
instance of: scholarly article
title: A simple finite cutting plane algorithm for integer programs
zbMATH Open document ID: 1258.90052
author: José Neto
published in: Operations Research Letters
publication date: 2013-03-05T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6141246
zbMATH Keywords: integer programming
zbMATH Keywords: cutting plane algorithm
zbMATH Keywords: finiteness
MaRDI profile type: Publication
full work available at URL: j.orl.2012.10.003
OpenAlex ID: W2037684433
cites work: Page cuts for integer interval linear programming
cites work: A finiteness proof for modified dantzig cuts in integer programming
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: A finitely converging cutting plane technique
DOI: 10.1016/J.ORL.2012.10.003
description: scientific article; zbMATH DE number 6141246