1. Altmanová, K., Knop, D., Koutecký, M.: Evaluating and tuning n-fold integer programming. In: D’Angelo, G. (ed.) 17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L’Aquila, Italy, vol. 103 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 10:1–10:14 (2018)
2. Assmann, S., Johnson, D., Kleitman, D., Leung, J.-T.: On a dual version of the one-dimensional bin packing problem. J. Algorithms 5, 502–525 (1984)
3. Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT electronic colloquium on computational complexity (ECCC) (2003)
4. Blazewicz, J., Kovalyov, M.Y., Musial, J., Urbanski, A.P., Wojciechowski, A.: Internet shopping optimization problem. Appl. Math. Comput. Sci. 20, 385–390 (2010)
5. Blazewicz, J., Bouvry, P., Kovalyov, M.Y., Musial, J.: Internet shopping with price sensitive discounts. 4OR 12, 35–48 (2014)