A probabilistic analysis of the multiknapsack value function
Authors:
- 1 January 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 46 (1-3) , 237-247
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analysesEuropean Journal of Operational Research, 1984
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Convex Analysis1970
- Three Problems in Rationing CapitalThe Journal of Business, 1955