Porumbel, D. C., Hao, J., & Glover, F. (2011). A simple and effective algorithm for the MaxMin diversity problem. Annals of operations research, 186(1), 275-293. https://doi.org/10.1007/s10479-011-0898-z
Citácia podle Chicago (17th ed.)Porumbel, Daniel Cosmin, Jin-Kao Hao, a Fred Glover. "A Simple and Effective Algorithm for the MaxMin Diversity Problem." Annals of Operations Research 186, no. 1 (2011): 275-293. https://doi.org/10.1007/s10479-011-0898-z.
Citácia podľa MLA (8th ed.)Porumbel, Daniel Cosmin, et al. "A Simple and Effective Algorithm for the MaxMin Diversity Problem." Annals of Operations Research, vol. 186, no. 1, 2011, pp. 275-293, https://doi.org/10.1007/s10479-011-0898-z.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..