Heuristics for the 0-1 min-knapsack problem

J. Csirik, J. B G Frenk, M. Labbe, S. Zhang

Research output: Contribution to journalArticlepeer-review

37 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)15-20
Number of pages6
JournalActa Cybernetica
Volume10
Issue number1-2
StatePublished - Jan 1 1991

Fingerprint

Dive into the research topics of 'Heuristics for the 0-1 min-knapsack problem'. Together they form a unique fingerprint.

Cite this