Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6892711 | Computers & Operations Research | 2018 | 12 Pages |
Abstract
We compared our algorithm with other approaches from the literature for a total of 32 data instances. We obtained a lower bound on 23 of the instances, which were at least as good as the lower bounds obtained by the state-of-the-art, and on eight of these, our lower bounds were higher. On two of the instances, our lower bound was an improvement of the currently best-known. Lastly, we compared our decomposition to the model without the decomposition on an additional six instances, which are much larger than the other 32. To our knowledge, this was the first time that lower bounds were calculated for these six instances.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Niels-Christian F. Bagger, Matias Sørensen, Thomas R. Stidsen,