1. Lecture Notes in Computer Science;UU Acikalin,2021
2. Ballew, B.: The distributor’s three-dimensional pallet-packing problem: a mathematical formulation and heuristic solution approach. Master’s thesis, Air Force Institute of Technology, March 2000
3. Borradaile, G., Heeringa, B., Wilfong, G.T.: The knapsack problem with neighbour constraints. J. Discrete Algorithms 16, 224–235 (2012)
4. Bringmann, K.: Fine-grained complexity theory (tutorial). In Rolf Niedermeier and Christophe Paul, editors, 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13–16, 2019, Berlin, Germany, vol. 126 of LIPIcs, pp. 4:1–4:7. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
5. Lecture Notes in Computer Science,2001