The complexity of the 0/1 multi-knapsack problem
Authors:
- 1 March 1986
- journal article
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 1 (1) , 46-50
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975