A faster exact method for large-scale knapsack problems with setup costs and times

Tomiyasu Ichimura*, Ryuichi Yokoyama, Hideki Magori

*この研究の対応する著者

研究成果: Article査読

1 被引用数 (Scopus)

抄録

A class of 0-1 knapsack problems having both setup costs and setup times in the classified item groups is treated. This class emerged relatively newly among many variants of the knapsack problems, and its fast solution methods for the large-scale instances are not yet published to the authors' best knowledge. From this viewpoint, the authors have proposed an extended exact method to tackle the large-scale ones much faster than that of the latest published. The proposed method can solve the instances with 10,000 groups and 1,000,000 items in a few seconds at the best performance. Some computational results are also given.

本文言語English
ページ(範囲)485-504
ページ数20
ジャーナルInternational Journal of Operational Research
14
4
DOI
出版ステータスPublished - 2012 6

ASJC Scopus subject areas

  • 経営科学およびオペレーションズ リサーチ

フィンガープリント

「A faster exact method for large-scale knapsack problems with setup costs and times」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル