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.
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 |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
An integer programming column generation principle for heuristic search methods
Zhao, Yixin, (2018)
-
Automating the self-scheduling process of nurses in Swedish healthcare : a pilot study
Rönnberg, Elina, (2010)
-
All-integer column generation for set partitioning : basic principles and extensions
Rönnberg, Elina, (2014)
- More ...