Optimization Online


An exact approach for the 01 Knapsack Problem with Setups

Federico Della Croce(federico.dellacroce***at***polito.it)
Fabio Salassa(fabio.salassa***at***polito.it)
Rosario Scatamacchia(rosario.scatamacchia***at***polito.it)

Abstract: We consider the 01 Knapsack Problem with Setups. We propose an exact approach which handles the structure of the ILP formulation of the problem. It relies on partitioning the variables set into two levels and exploiting this partitioning. The proposed approach favorably compares to the algorithms in literature and to solver CPLEX 12.5 applied to the ILP formulation. It turns out to be very effective and capable of solving to optimality, within limited CPU time, all instances with up to 100000 variables.

Keywords: Knapsack Problem with Setups, Exact approach, 01 Programming

Category 1: Combinatorial Optimization


Download: [PDF]

Entry Submitted: 10/29/2016
Entry Accepted: 10/30/2016
Entry Last Modified: 10/29/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society