Citace podle APA (7th ed.)

Coniglio, S., Furini, F., & San Segundo, P. (2021). A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts. European journal of operational research, 289(2), 435-455. https://doi.org/10.1016/j.ejor.2020.07.023

Citace podle Chicago (17th ed.)

Coniglio, Stefano, Fabio Furini, a Pablo San Segundo. "A New Combinatorial Branch-and-bound Algorithm for the Knapsack Problem with Conflicts." European Journal of Operational Research 289, no. 2 (2021): 435-455. https://doi.org/10.1016/j.ejor.2020.07.023.

Citace podle MLA (9th ed.)

Coniglio, Stefano, et al. "A New Combinatorial Branch-and-bound Algorithm for the Knapsack Problem with Conflicts." European Journal of Operational Research, vol. 289, no. 2, 2021, pp. 435-455, https://doi.org/10.1016/j.ejor.2020.07.023.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..