Faenza, Y., Segev, D., & Zhang, L. (2023). Approximation algorithms for the generalized incremental knapsack problem. Mathematical programming, 198(1), 27-83. https://doi.org/10.1007/s10107-021-01755-7
Citácia podle Chicago (17th ed.)Faenza, Yuri, Danny Segev, a Lingyi Zhang. "Approximation Algorithms for the Generalized Incremental Knapsack Problem." Mathematical Programming 198, no. 1 (2023): 27-83. https://doi.org/10.1007/s10107-021-01755-7.
Citácia podľa MLA (8th ed.)Faenza, Yuri, et al. "Approximation Algorithms for the Generalized Incremental Knapsack Problem." Mathematical Programming, vol. 198, no. 1, 2023, pp. 27-83, https://doi.org/10.1007/s10107-021-01755-7.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..