A faster exact method for large-scale knapsack problems with setup costs and times (Q2627316)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A faster exact method for large-scale knapsack problems with setup costs and times |
scientific article |
Statements
A faster exact method for large-scale knapsack problems with setup costs and times (English)
0 references
31 May 2017
0 references
Summary: 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.
0 references
0-1 knapsack problems
0 references
setup times
0 references
setup costs
0 references
large-scale knapsack problems
0 references
branch and bound
0 references
relaxation
0 references
heuristics
0 references
pegging
0 references