1. Bazgan, C., Hugot, H., and Vanderpooten, D., Implementing an efficient fptas for the 0-1 multi-objective knapsack problem, European Journal of Operational Research, Vol.198, No.1, (2009), pp.47–56.
2. Erlebach, T., Kellerer, H., and Pferschy, U., Approximating multiobjective knapsack problems, Management Science, Vol.48, No.12, (2002), pp.1603–1612.
3. Hashiguchi, Y., Karuno, Y., and Tateishi, K., Lexicographic bi-criteria food packing problem with a given tolerance for the total weight of a package, Proceedings of International Symposium on Scheduling 2015 (ISS 2015, SSJ) (2015), pp.175–180.
4. Imahori, S., Karuno, Y., and Tateishi, K., Dynamic programming algorithms for producing food mixture packages by automatic combination weighers, Journal of Advanced Mechanical Design, Systems, and Manufacturing, Vol.8, No.5, (2014), DOI: 10.1299/jamdsm.2014jamdsm0065.
5. Imahori, S., Karuno, Y., and Tateishi, K., Pseudo-polynomial time algorithms for combinatorial food mixture packing problems, Journal of Industrial and Management Optimization, Vol.12, No.5, (2016), pp.1057–1073.