Rieger, A., & Segev, D. (2024). Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings. Mathematical programming, 208(1-2), 111-171. https://doi.org/10.1007/s10107-023-02033-4
Citace podle Chicago (17th ed.)Rieger, Alon, a Danny Segev. "Quasi-polynomial Time Approximation Schemes for Assortment Optimization Under Mallows-based Rankings." Mathematical Programming 208, no. 1-2 (2024): 111-171. https://doi.org/10.1007/s10107-023-02033-4.
Citace podle MLA (9th ed.)Rieger, Alon, a Danny Segev. "Quasi-polynomial Time Approximation Schemes for Assortment Optimization Under Mallows-based Rankings." Mathematical Programming, vol. 208, no. 1-2, 2024, pp. 111-171, https://doi.org/10.1007/s10107-023-02033-4.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..