The complexity of the 0/1 multi-knapsack problem

DOI10.1007/BF02943300zbMath0593.68036MaRDI QIDQ1076516

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)

Related Items (3)

On the computational complexity of the virtual network embedding problem ⋮ Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• `` Strong NP-Completeness Results

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