Author:
Drake John H.,Swan Jerry,Neumann Geoff,Özcan Ender
Publisher
Springer International Publishing
Reference27 articles.
1. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Hoboken (1990)
2. Lecture Notes in Computer Science;J Csirik,1998
3. Coffman Jr., E.G., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Pardalos, P.M., Du, D.Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 455–531. Springer, New York (2013)
4. Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. J. ACM 32(3), 562–572 (1985)
5. Sinuany-Stern, Z., Weiner, I.: The one dimensional cutting stock problem using two objectives. J. Oper. Res. Soc. 45(2), 231–236 (1994)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献