A Lagrangean based solution algorithm for the knapsack problem with setups

作者：

Highlights：

• This paper studies the knapsack problem with setups.

• This paper presents an algorithm based on a Lagrangean relaxation of the problem.

• We used very large data sets to test the algorithm.

• The algorithm can solve near optimally the problem in reasonable amount of time.

摘要

•This paper studies the knapsack problem with setups.•This paper presents an algorithm based on a Lagrangean relaxation of the problem.•We used very large data sets to test the algorithm.•The algorithm can solve near optimally the problem in reasonable amount of time.

论文关键词：Knapsack problem with setups,Lagrangean relaxation

论文评审过程：Received 18 May 2017, Revised 17 October 2019, Accepted 5 November 2019, Available online 9 November 2019, Version of Record 14 November 2019.

论文官网地址：https://doi.org/10.1016/j.eswa.2019.113077