Author:
Marchetti-Spaccamela A.,Vercellis C.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference19 articles.
1. L. Breiman,Probability (Addison-Wesley, Reading, MA, 1968).
2. P.M. Camerini, F. Maffioli and C. Vercellis, “Multi-constrained matroidal knapsack problems”,Mathematical Programming 45 (1989) 211–231.
3. K.L. Chung,A Course in Probability Theory (Academic Press, New York, 1974).
4. E.G. Coffman and F.T. Leighton, “A provably efficient algorithm for dynamic storage allocation”,Proceedings 18th Annual ACM Symposium on Theory of Computing (ACM, New York, 1986) 77–88.
5. M.A.H. Dempster, M.L. Fisher, L. Jansen, B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kan, “Analysis of heuristics for stochastic programming: results for hierarchical scheduling problems”,Mathematics of Operations Research 8 (1983) 525–538.
Cited by
78 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献