Optimization Online


Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem

Federico Della Croce(federico.dellacroce***at***polito.it)
Ulrich Pferschy(pferschy***at***uni-graz.at)
Rosario Scatamacchia(rosario.scatamacchia***at***polito.it)

Abstract: We consider the 0-1 Penalized Knapsack Problem (PKP). Each item has a profit, a weight and a penalty and the goal is to maximize the sum of the profits minus the greatest penalty value of the items included in a solution. We propose an exact approach relying on a procedure which narrows the relevant range of penalties, on the identification of a core problem and on dynamic programming. The proposed approach turns out to be very effective in solving hard instances of PKP and compares favorably both to commercial solver CPLEX 12.5 applied to the ILP formulation of the problem and to the best available exact algorithm in the literature. Then we present a general inapproximability result and investigate several relevant special cases which permit fully polynomial time approximation schemes (FPTASs).

Keywords: Penalized Knapsack problem, Exact algorithm, Dynamic Programming, Approximation Schemes

Category 1: Combinatorial Optimization

Category 2: Integer Programming (0-1 Programming )

Category 3: Other Topics (Dynamic Programming )


Download: [PDF]

Entry Submitted: 02/15/2017
Entry Accepted: 03/01/2017
Entry Last Modified: 02/15/2017

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