RIEGER, Alon und SEGEV, Danny, 2024. Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings. Mathematical Programming. 1 November 2024. Vol. 208, no. 1/2, p. 111-171. DOI 10.1007/s10107-023-02033-4.
Elsevier - Harvard (with titles)Rieger, A., Segev, D., 2024. Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings. Mathematical Programming 208, 111-171. https://doi.org/10.1007/s10107-023-02033-4
American Psychological Association 7th editionRieger, 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
Springer - Basic (author-date)Rieger A, Segev D (2024) Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings.. Mathematical Programming 208:111-171. https://doi.org/10.1007/s10107-023-02033-4
Juristische Zitierweise (Stüber) (Deutsch)Rieger, Alon/ Segev, Danny, Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings., Mathematical Programming 2024, 111-171.