Integer optimization with penalized fractional values: The Knapsack case.

•We consider a variant of the knapsack problem with penalized fractional items.•We present mathematical models, and exact algorithms based on dynamic programming.•We introduce approximate and heuristic algorithms.•The proposed approaches proved successful on a large benchmark of hard instances.