Ali Aouad

Orcid: 0000-0002-9812-6140

According to our database1, Ali Aouad authored at least 18 papers between 2018 and 2024.

Collaborative distances:

Timeline

2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
7
8
2
5
2
2
1
2
2
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Choice-Learn: Large-scale choice modeling for operational contexts through the lens of machine learning.
J. Open Source Softw., 2024

Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence.
CoRR, 2024

2023
Technical Note - An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem.
Oper. Res., July, 2023

The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications.
Oper. Res., July, 2023

The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model?
Manag. Sci., May, 2023

Online Assortment Optimization for Two-Sided Matching Platforms.
Manag. Sci., April, 2023

Market Segmentation Trees.
Manuf. Serv. Oper. Manag., March, 2023

Centralized Versus Decentralized Pricing Controls for Dynamic Matching Platforms.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Dynamic Stochastic Matching Under Limited Time.
Oper. Res., 2022

Representing Random Utility Choice Models with Neural Networks.
CoRR, 2022

2021
Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences.
Manag. Sci., 2021

Assortment Optimization Under Consider-Then-Choose Choice Models.
Manag. Sci., 2021

2020
An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem.
CoRR, 2020

2019
The ordered k-median problem: surrogate models and approximation algorithms.
Math. Program., 2019

Approximation Algorithms for Dynamic Assortment Optimization Models.
Math. Oper. Res., 2019

2018
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences.
Oper. Res., 2018

The Approximability of Assortment Optimization Under Ranking Preferences.
Oper. Res., 2018


  Loading...