A PTAS for the multiple subset sum problem with different knapsack capacities
type: Item
instance of: scholarly article
title: A PTAS for the multiple subset sum problem with different knapsack capacities
zbMATH Open document ID: 1014.68225
DOI: 10.1016/S0020-0190(00)00010-7
author: Alberto Caprara
author: Hans Kellerer
author: Ulrich Pferschy
published in: Information Processing Letters
publication date: 2002-07-25T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1771747
zbMATH Keywords: multiple subset sum problem
MaRDI profile type: Publication
cites work: Approximation algorithms for the multiple knapsack problem with assignment restrictions
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: Q4941826
cites work: Integer Programming with a Fixed Number of Variables
description: scientific article; zbMATH DE number 1771747