Column generation in the integral simplex method

The integral simplex method for set partitioning problems allows only pivots-on-one to be made, which results in a primal all-integer method. In this technical note we outline how to tailor the column generation principle to this method. Because of the restriction to pivots-on-one, only local optimality can be guaranteed, and to ensure global optimality we consider the use of implicit enumeration.

MoreLess

Year of publication:	2009
Authors:	Rönnberg, Elina ; Larsson, Torbjörn
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 192.2009, 1, p. 333-342
Publisher:	Elsevier
Keywords:	Integer programming Set partitioning Column generation Implicit enumeration Quasi-integrality

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005158369