Connexion
Idée - Assortment Optimization
Effiziente Algorithmen für die Optimierung von Sortimenten
Effiziente Algorithmen für die Regret-Minimierung bei der Sortimentsauswahl mit Plackett-Luce-basierten Benutzerpräferenzen.
No-Choice에 의존하지 말고 움직임을 반복하지 마세요: Assortment Optimization을 위한 최적, 효율적 및 실용적 알고리즘
실용적이고 효율적인 알고리즘을 통해 No-Choice에 의존하지 않고 Assortment Optimization 문제를 해결합니다.
Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
Optimizing two-sided assortments through adaptivity and approximation.
Optimizing Conference Goodies for Indifferent Attendees
The authors explore the optimal assortment of conference goodies for indifferent attendees, showing that equal amounts of each type minimize unhappy attendees.
Produits | Ressources
© 2024 by Linnk AI