Even, G., & Halabi, N. (2015). Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming. IEEE transactions on information theory, 61(10), 5295-5305. https://doi.org/10.1109/TIT.2015.2466598
Citácia podle Chicago (17th ed.)Even, Guy, a Nissim Halabi. "Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming." IEEE Transactions on Information Theory 61, no. 10 (2015): 5295-5305. https://doi.org/10.1109/TIT.2015.2466598.
Citácia podľa MLA (8th ed.)Even, Guy, a Nissim Halabi. "Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming." IEEE Transactions on Information Theory, vol. 61, no. 10, 2015, pp. 5295-5305, https://doi.org/10.1109/TIT.2015.2466598.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..