Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Business
Exact And Heuristic Solution Approaches For The Mixed Integer Setup Knapsack Problem, Nezih Altay, Powell Robinson, Kurt Bretthauer
Exact And Heuristic Solution Approaches For The Mixed Integer Setup Knapsack Problem, Nezih Altay, Powell Robinson, Kurt Bretthauer
Nezih Altay
We consider a class of knapsack problems that include setup costs for families of items. An individual item can be loaded into the knapsack only if a setup cost is incurred for the family to which it belongs. A mixed integer programming formulation for the problem is provided along with exact and heuristic solution methods. The exact algorithm uses cross decomposition. The proposed heuristic gives fast and tight bounds. In addition, a Benders decomposition algorithm is presented to solve the continuous relaxation of the problem. This method for solving the continuous relaxation can be used to improve the performance of …