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

Tomiyasu Ichimura, Ryuichi Yokoyama and Hideki Magori

International Journal of Operational Research, 2012, vol. 14, issue 4, 485-504

Abstract: 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.

Keywords: 0-1 knapsack problems; setup times; setup costs; large-scale knapsack problems; branch and bound; relaxation; heuristics; pegging. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=47517 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:14:y:2012:i:4:p:485-504

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().