Follow
Tien Mai
Tien Mai
School of Computing and Information Systems, Singapore Management University
Verified email at smu.edu.sg - Homepage
Title
Cited by
Cited by
Year
Bike route choice modeling using GPS data without choice sets of paths
M Zimmermann, T Mai, E Frejinger
Transportation research part C: emerging technologies 75, 183-196, 2017
1872017
A nested recursive logit model for route choice analysis
T Mai, M Fosgerau, E Frejinger
Transportation Research Part B: Methodological 75, 100-112, 2015
1542015
A multicut outer-approximation approach for competitive facility location under random utilities
T Mai, A Lodi
European Journal of Operational Research 284 (3), 874-881, 2020
602020
A decomposition method for estimating recursive logit based route choice models
T Mai, F Bastin, E Frejinger
EURO Journal on Transportation and Logistics 7 (3), 253-275, 2018
512018
Route choice behaviour and travel information in a congested network: Static and dynamic recursive models
G de Moraes Ramos, T Mai, W Daamen, E Frejinger, SP Hoogendoorn
Transportation Research Part C: Emerging Technologies 114, 681-693, 2020
452020
A method of integrating correlation structures for a generalized recursive route choice model
T Mai
Transportation Research Part B: Methodological 93, 146-161, 2016
442016
Submodularity and Local Search Approaches for Maximum Capture Problems under Generalized Extreme Value Models
TT Dam, TA Ta, T Mai
European Journal of Operational Research, 2021
232021
A misspecification test for logit based route choice models
T Mai, E Frejinger, F Bastin
Economics of Transportation 4 (4), 215-226, 2015
182015
On Optmization Algorithms for Maximum Likelihood Estimation
AT Mai, M Toulouse, F Bastin
CIRRELT, Centre interuniversitaire de recherche sur les réseaux d'entreprise …, 2014
172014
On the similarities between random regret minimization and mother logit: The case of recursive route choice models
T Mai, F Bastin, E Frejinger
Journal of choice modelling 23, 21-33, 2017
152017
Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm
T Mai, X Yu, S Gao, E Frejinger
Transportation Research Part B: Methodological 151, 42-58, 2021
132021
Undiscounted recursive path choice models: Convergence properties and algorithms
T Mai, E Frejinger
Transportation Science 56 (6), 1469-1482, 2022
122022
A dynamic programming approach for quickly estimating large network-based MEV models
T Mai, E Frejinger, M Fosgerau, F Bastin
Transportation Research Part B: Methodological 98, 179-197, 2017
122017
Robust maximum capture facility location under random utility maximization models
TT Dam, TA Ta, T Mai
European Journal of Operational Research 310 (3), 1128-1150, 2023
112023
On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling
TA Ta, T Mai, F Bastin, P L’Ecuyer
Mathematical Programming 190, 1-37, 2021
72021
A relation analysis of Markov decision process frameworks
T Mai, P Jaillet
arXiv preprint arXiv:2008.07820, 2020
72020
Generalized maximum causal entropy for inverse reinforcement learning
T Mai, K Chan, P Jaillet
arXiv preprint arXiv:1911.06928, 2019
72019
Dynamic programming approaches for estimating and applying large-scale discrete choice models
AT Mai
72016
Robust multi-product pricing under generalized extreme value models
T Mai, P Jaillet
arXiv preprint arXiv:1912.09552, 2021
62021
Comparing regret minimization and utility maximization for route choice using the recursive logit model
T Mai, E Frejinger, F Bastin
CIRRELT, Centre interuniversitaire de recherche sur les réseaux d'entreprise …, 2015
62015
The system can't perform the operation now. Try again later.
Articles 1–20