The complexity of the 0/1 multi-knapsack problem
type: Item
instance of: scholarly article
title: The complexity of the 0/1 multi-knapsack problem
zbMATH Open document ID: 0593.68036
DOI: 10.1007/BF02943300
author: Suyun Geng
author: Li'ang Zhang
published in: Journal of Computer Science and Technology
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3954274
zbMATH Keywords: multi-set
zbMATH Keywords: decision problem
zbMATH Keywords: NP-complete
zbMATH Keywords: multi-knapsack optimization problem
MaRDI profile type: Publication
cites work: Q4198056
cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints
cites work: `` Strong '' NP-Completeness Results
description: scientific article; zbMATH DE number 3954274