Finite Primal Cutting Plane Algorithms for Integer Programs

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1979 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Control and Optimization, volume 17, pages 47-55 (issn: 0363-0129, eissn: 1095-7138,

Copyright policy )

Authors: Links, Graham; Rubin, David S.;

doi: 10.1137/0317005

Finite Primal Cutting Plane Algorithms for Integer Programs

- Summary
- Subjects
- Metrics

Abstract

Several primal cutting plane algorithms have been proposed for the pure integer program. They all require that the entire tableau remain integral at every iteration. We show how to relax this condition and require integrality of only the right hand side. Several cuts are discussed, and sufficient conditions to guarantee finiteness are developed.

Keywords

Integer programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average