Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481892 | European Journal of Operational Research | 2009 | 10 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Elina Rönnberg, Torbjörn Larsson,