Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings.

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
  • المؤلفون: Rieger, Alon1 (AUTHOR); Segev, Danny1 (AUTHOR)
  • المصدر:
    Mathematical Programming. Nov2024, Vol. 208 Issue 1/2, p111-171. 61p.