Abstract
The optimal solution value of the multiknapsack problem as a function of the knapsack capacities is studied under the assumption that the profit and weight coefficients are generated by an appropriate random mechanism. A strong asymptotic characterization is obtained, that yiclds a closed form expression for certain special cases.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. d'Atri, “Probabilistic analysis of the knapsack problem,” Technical Report No. 7, Groupe de Recherche 22, Centre National de la Recherche Scientifique (Paris, 1978).
G. Ausiello, A. Marchetti-Spaccamela and M. Protasi, “Probabilistic analysis of the solution of the knapsack problem,” in:Proceedings of the Tenth IFIP Conference (Springer, New York, 1982) pp. 557–565.
A.V. Fiacco and G.P. McCormick,Nonlinear Programming:Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968).
A.M. Frieze and M.R.B. Clarke, “Approximation algorithms for them-dimensional 0-1 knapsack problem: worst-case and probabilistic analysis,”European Journal of Operations Research 15 (1984) 100–109.
M.R. Garey and D.S. Johnson, “Strong NP-completeness results: motivation, examples and implications,”Journal of the Association of Computer Machinery 25 (1978) 499–508.
M.R. Garey and D.S. Johnson,Computers and Intractability:A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
A.V. Goldberg and A. Marchetti-Spaccamela, “On finding the exact solution of a 0-1 knapsack problem,” in:Proceedings of the 16th ACM Symposium on Theory of Computing (Association for Computing Machinery, New York, 1984) pp. 359–368.
M. Loève,Probability Theory (Springer, New York, 1977).
J. Lorie and L. Savage, “Three problems in capital rationing,”Journal of Business 28 (1955) 229–239.
G.S. Lueker, “On the average difference between the solution to linear and integer knapsack problems,”Applied Probability-Computer Science, the Interface, Vol. 1 (Birkhauser, Basel, 1982) pp. 489–504.
R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
B. Weide, “Statistical methods in algorithm design and analysis,” Ph-D thesis, CMU-CS 78-142, Carnegie-Mellon University (Pittsburgh, PA, 1978).
Author information
Authors and Affiliations
Additional information
This research was partially supported by NSF Grant ECS-83-16224, and MPI Project “Matematica computazionale”.
Rights and permissions
About this article
Cite this article
Meanti, M., Rinnooy Kan, A.H.G., Stougie, L. et al. A probabilistic analysis of the multiknapsack value function. Mathematical Programming 46, 237–247 (1990). https://doi.org/10.1007/BF01585741
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585741