A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
From MaRDI portal
Publication:1208445
DOI10.1016/0020-0190(92)90089-EzbMath0793.90040MaRDI QIDQ1208445
Publication date: 16 May 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)
Related Items
An approximate binary search algorithm for the multiple-choice knapsack problem, A Fast Approximation Algorithm For The Subset-Sum Problem
Cites Work