A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Local Branching Strategy-Based Method for the Knapsack Problem with Setup
2020
Computer Science & Information Technology (CS & IT)
unpublished
In this paper, we propose to solve the knapsack problem with setups by combining mixed linear relaxation and local branching. The problem with setups can be seen as a generalization of 0–1 knapsack problem, where items belong to disjoint classes (or families) and can be selected only if the corresponding class is activated. The selection of a class involves setup costs and resource consumptions thus affecting both the objective function and the capacity constraint. The mixed linear relaxation
doi:10.5121/csit.2020.101606
fatcat:ou3wsglxxngtrlzzeofyx4qydq