Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference32 articles.
1. Alon, N., Azar, Y., Csirik, J., Epstein, L., Sevastianov, S. V., Vestjens, A. P. A., et al. (1998). On-line and off-line approximation algorithms for vector covering problems. Algorithmica, 12, 104–118.
2. Assmann, S. F. (1983). Problems in discrete applied mathematics. Ph.D. thesis, Mathematics Department, Massachusetts Institute of Technology.
3. Assmann, S. F., Johnson, D. S., Kleitman, D. J., & Leung, J. Y.-T. (1984). On a dual version of the one-dimensional bin packing problem. Journal of Algorithms, 5, 502–525.
4. Bar-Noy, A., Ladner, R. E., & Tamir, T. (2007). Windows scheduling as a restricted version of bin packing. ACM Transactions on Algorithms, 3(3), 28.
5. Bruno, J. L., & Downey, P. J. (1985). Probabilistic bounds for dual bin-packing. Acta Informatica, 22, 333–345.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献