The Approximability of Assortment Optimization Under Ranking Preferences. - Ali Aouad; Vivek F. Farias; Retsef Levi; Danny Segev (Oper. Res., 2018)

Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences. - Ali Aouad; Retsef Levi; Danny Segev (Oper. Res., 2018)

Approximation Algorithms for Dynamic Assortment Optimization Models. - Ali Aouad; Retsef Levi; Danny Segev (Math. Oper. Res., 2019)

The ordered k-median problem: surrogate models and approximation algorithms. - Ali Aouad; Danny Segev (Math. Program., 2019)

An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem. - Ali Aouad; Danny Segev (CoRR, 2020)

Assortment Optimization Under Consider-Then-Choose Choice Models. - Ali Aouad; Vivek F. Farias; Retsef Levi (Manag. Sci., 2021)

Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences. - Ali Aouad; Danny Segev (Manag. Sci., 2021)

Representing Random Utility Choice Models with Neural Networks. - Ali Aouad; Antoine Désir (CoRR, 2022)

Dynamic Stochastic Matching Under Limited Time. - Ali Aouad; Ömer Saritaç (Oper. Res., 2022)

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals. - Ali Aouad; Will Ma (EC, 2023)

Centralized Versus Decentralized Pricing Controls for Dynamic Matching Platforms. - Ali Aouad; Ömer Saritaç; Chiwei Yan (EC, 2023)

Market Segmentation Trees. - Ali Aouad; Adam N. Elmachtoub; Kris Johnson Ferreira; Ryan McNellis (Manuf. Serv. Oper. Manag., 2023)

Online Assortment Optimization for Two-Sided Matching Platforms. - Ali Aouad; Daniela Sabán (Manag. Sci., 2023)

The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model? - Ali Aouad; Jacob B. Feldman; Danny Segev (Manag. Sci., 2023)

The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications. - Ali Aouad; Danny Segev (Oper. Res., 2023)

Technical Note - An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem. - Ali Aouad; Danny Segev (Oper. Res., 2023)

Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence. - Alireza AmaniHamedani; Ali Aouad; Tristan Pollner; Amin Saberi (CoRR, 2024)

Choice-Learn: Large-scale choice modeling for operational contexts through the lens of machine learning. - Vincent Auriau; Ali Aouad; Antoine Désir; Emmanuel Malherbe (J. Open Source Softw., 2024)

Adaptive Approximation Schemes for Matching Queues. - Alireza AmaniHamedani; Ali Aouad; Amin Saberi (STOC, 2025)

The Click-Based MNL Model: A Framework for Modeling Click Data in Assortment Optimization. - Ali Aouad; Jacob B. Feldman; Danny Segev; Dennis J. Zhang (Manag. Sci., 2025)

The Pandora's Box Problem with Sequential Inspections. - Ali Aouad; Jingwei Ji; Yaron Shaposhnik (CoRR, 2025)