1. Axiotis, K., Tzamos, C.: Capacitated dynamic programming: faster knapsack and graph algorithms. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP), Dagstuhl, Germany, vol. 132, pp. 19:1–19:13 (2019)
2. Bateni, M., Hajiaghayi, M., Seddighin, S., Stein, C.: Fast algorithms for knapsack via convolution and prediction. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, New York, NY, USA, pp. 1269–1282 (2018)
3. Belkhale, K.P., Banerjee, P.: An approximate algorithm for the partitionable independent task scheduling problem. In: International Conference on Parallel Processing (ICPP), pp. 72–75 (1990)
4. Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)
5. Cygan, M., Mucha, M., Wegrzycki, K., Wlodarczyk, M.: On problems equivalent to (min, +)-convolution. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). LIPIcs, vol. 80, pp. 22:1–22:15 (2017)