Approximate algorithms for some generalized knapsack problems
type: Item
instance of: scholarly article
title: Approximate algorithms for some generalized knapsack problems
zbMATH Open document ID: 0359.90053
DOI: 10.1016/0304-3975(76)90048-7
author: K. Appert
published in: Theoretical Computer Science
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 3561087
MaRDI profile type: Publication
full work available at URL: 0304-3975(76)90048-7
OpenAlex ID: W2024427769
cites work: Q3214706
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Approximation algorithms for combinatorial problems
cites work: Q4142699
cites work: Q5581642
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
cites work: Storage cost considerations in secondary index selection
description: scientific article; zbMATH DE number 3561087