Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
type: Item
instance of: scholarly article
title: Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
zbMATH Open document ID: 1064.90026
DOI: 10.1016/S0167-6377(02)00222-5
author: James M. Calvin
author: Joseph Y.-T. Leung
published in: Operations Research Letters
publication date: 2003-06-17T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1929385
zbMATH Keywords: 0/1 knapsack
zbMATH Keywords: NP-hard
zbMATH Keywords: approximation algorithms
zbMATH Keywords: probabilistic analysis
MaRDI profile type: Publication
cites work: Q5560061
cites work: Probabilistic Analysis of the Multidimensional Knapsack Problem
cites work: Q4198056
cites work: On rates of convergence and asymptotic normality in the multiknapsack problem
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Q4076577
cites work: Q3792481
cites work: Average-Case Analysis of Off-Line and On-Line Knapsack Problems
cites work: Q3783565
cites work: A probabilistic analysis of the multiknapsack value function
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
full work available at URL: s0167-6377(02)00222-5
OpenAlex ID: W2041429356
description: scientific article; zbMATH DE number 1929385