Lalou, M., & Kheddouci, H. (2023). Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items. Computers & operations research, 158, 106281. https://doi.org/10.1016/j.cor.2023.106281
Citácia podle Chicago (17th ed.)Lalou, Mohammed, a Hamamache Kheddouci. "Pseudo-polynomial Algorithms for Solving the Knapsack Problem with Dependencies Between Items." Computers & Operations Research 158 (2023): 106281. https://doi.org/10.1016/j.cor.2023.106281.
Citácia podľa MLA (8th ed.)Lalou, Mohammed, a Hamamache Kheddouci. "Pseudo-polynomial Algorithms for Solving the Knapsack Problem with Dependencies Between Items." Computers & Operations Research, vol. 158, 2023, p. 106281, https://doi.org/10.1016/j.cor.2023.106281.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..