| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10347155 | Computers & Operations Research | 2012 | 21 Pages |
Abstract
Our computational experiments on benchmark instances indicate that the proposed algorithm is competitive with the other algorithms. Our algorithm succeeded to find the optimal values for most of the instances in a practical time. Especially, it determined that the optimal values of instances “gcut02” and “cgcut02” (without rotations) are 1187 and 64, respectively, which have not been obtained by any of the other existing algorithms.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Yohei Arahori, Takashi Imamichi, Hiroshi Nagamochi,