Heuristics for the 0-1 Min-Kanpsack Problem

  J.Csirik J.B.G. Frenk M.Labbé S.Zhang

Abstract:

  The 0-1 min-knapsack problem consists in finding a subset of items such that the sum of their sizes is larger than or equal to a given constant and the sum of their costs is minimized. We first study a greedy-type heuristic having a worst-case bound of 2. This heuristic is then refined to obtain a new one with a worst-case bound of 3/2.

 Gyenizse Pal 1996. Szeptember 4. Szerda 14:09:56 MET DST