Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference8 articles.
1. Karp, R. M.,On the Computational Complexity of Combinatorial Problems, Networks, Vol. 5, pp. 45?68, 1975.
2. Hardy, G. H., Littlewood, J. E., andPólya, G.,Inequalities, 2nd Edition, University Press, Cambridge, England, 1952.
3. Garey, M. R., Hwang, F. K., andJohnson, D. S.,Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units, IEEE Transactions on Computers, Vol. C-26, pp. 321?328, 1977.
4. Chandra, A. K., andWong, C. K.,Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation, SIAM Journal on Computing, Vol. 4, pp. 249?263, 1975.
5. Easton, M. C., andWong, C. K.,A Near-Optimal Solution to a Storage Allocation Problem, Journal of the Association for Computing Machinery, Vol. 22, pp. 441?449, 1975.
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献