The complexity of the 0/1 multi-knapsack problem

DOI10.1007/BF02943300MaRDI QIDQ1076516zbMATH OpenFDO

Authors Suyun Geng, Li'ang Zhang

Publication date 1986

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

NP-completedecision problemmulti-knapsack optimization problemmulti-set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4005978
• scientific article; zbMATH DE number 1302173
• scientific article; zbMATH DE number 4031399
• The multidimensional 0-1 knapsack problem: an overview.
• Approximation for multi-knapsack problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• `` Strong NP-Completeness Results

Cited in

(8)

• scientific article; zbMATH DE number 7559382 (Why is no real title available?)
• scientific article; zbMATH DE number 4098714 (Why is no real title available?)
• On the computational complexity of the virtual network embedding problem
• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
• Adjacency of the 0-1 knapsack problem
• On a communication complexity problem in combinatorial number theory
• Some computational results on real 0-1 knapsack problems
• Comment on 'Some computational results on real 0-1 knapsack problems'

This page was built for publication: The complexity of the 0/1 multi-knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076516)