A new hybrid heuristic for the 0–1 knapsack sharing problem


In this paper we consider the 0-1 knapsack sharing problem, which is a max-min optimization problem with a knapsack constraint. This problem has a wide range of commercial applications and occurs when resources have to be shared or distributed fairly to several entities. We propose a new hybrid heuristic combining an iterative linear programming-based… (More)

2 Figures and Tables


  • Presentations referencing similar topics