A steepest edge rule for a column generation approach to the convex recoloring problem

Show simple item record

dc.contributor.author Erdem, Ergin
dc.contributor.author Gahler, Kenneth
dc.contributor.author Kim, Eunseok
dc.contributor.author Shim, Sang Ho
dc.date.accessioned 2020-03-21T16:07:12Z
dc.date.available 2020-03-21T16:07:12Z
dc.date.issued 2018
dc.identifier.citation Erdem, E., Gahler, K., Kim, E. and Shim, S. (2018). A steepest edge rule for a column generation approach to the convex recoloring problem, ASEE, Salt Lake City, UT en_US
dc.identifier.uri http://hdl.handle.net/11347/352
dc.description.abstract The convex recoloring problem is a clustering problem to partition nodes of a network into connected subnetworks. We develop a hybrid rule combining the Dantzig’s Rule and the Steepest Edge Rule to produce columns which enter into the basis of the master problem in the column generation framework introduced by Chopra et al. [2]. The hybrid rule leads to only a small number of iterations and makes it possible to perform the column generation approach in an undergraduate class using Microsoft Excel. We perform a large scale computational experiment and show that the hybrid rule is effective. en_US
dc.language.iso en_US en_US
dc.publisher ASEE en_US
dc.subject convex recoloring problem en_US
dc.subject column generation framework en_US
dc.subject linear programming problem en_US
dc.subject Steepest Edge Rule en_US
dc.subject nodes en_US
dc.title A steepest edge rule for a column generation approach to the convex recoloring problem en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics