Author:
Ashikhmin I. V.,Furems E. M.
Reference26 articles.
1. Furems, E.M., The inverse bin-packing problem subject to qualitative criteria, Sci. Tech. Inf. Process., 2017, vol. 44, no. 6, pp. 440–449.
2. Martello, S., and Toth, P., Solution of the zero-one multiple knapsack problem, Eur. J. Oper. Res., 1980, vol. 4, no. 4, pp. 276–283.
3. Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., and Graham, R.L., Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput., 1974, vol. 3, no. 4, pp. 299–325.
4. Coffman, E.G., Jr., Leung, J.Y.-T., and Ting, D., Bin packing: Maximizing the number of pieces packed, Acta Inf., 1978, vol. 9, pp. 263–271.
5. Ashikhmin, I.V., Production rules and preferences, Tret’ya Mezhdunarodnaya konferentsiya “Sistemnyi analiz i informatsionnye tekhnologii” SAIT—2009: Trudy konferentsii (Proc. 3rd Int. Conf. System Analysis and Information Technologies SAIT 2009), Moscow, 2009, pp. 247–251.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献