Author:
Jansen Klaus,Solis-Oba Roberto
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D.S. (ed.) Approximation algorithms for NP-hard problems, pp. 46–86. PWS Publishing Company (1997)
2. Eisemann, K.: The trim problem. Management Science 3(3), 279–284 (1957)
3. Eisenbrand, F., Shmonin, G.: Carathéorody bounds for integer cones. Operations Research Letters 34, 564–568 (2006)
4. Filippi, C., Agnetis, A.: An asymptotically exact algorithm for the high-multiplicity bin packing problem. Mathematical Programming 104(1), 21–57 (2005)
5. Filippi, C.: On the bin packing problem with a fixed number of object weights. European Journal of Operational Research 181, 117–126 (2007)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献