Tien Mai

662 total citations
31 papers, 434 citations indexed

About

Tien Mai is a scholar working on Economics and Econometrics, Transportation and Marketing. According to data from OpenAlex, Tien Mai has authored 31 papers receiving a total of 434 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Economics and Econometrics, 15 papers in Transportation and 10 papers in Marketing. Recurrent topics in Tien Mai's work include Economic and Environmental Valuation (19 papers), Transportation Planning and Optimization (15 papers) and Consumer Market Behavior and Pricing (10 papers). Tien Mai is often cited by papers focused on Economic and Environmental Valuation (19 papers), Transportation Planning and Optimization (15 papers) and Consumer Market Behavior and Pricing (10 papers). Tien Mai collaborates with scholars based in Singapore, Canada and Vietnam. Tien Mai's co-authors include Emma Frejinger, Mogens Fosgerau, Fabian Bastin, Andrea Lodi, Winnie Daamen, Serge Hoogendoorn, Song Gao, Michel Toulouse, Arunesh Sinha and Tho V. Le and has published in prestigious journals such as European Journal of Operational Research, Transportation Research Part C Emerging Technologies and Transportation Research Part B Methodological.

In The Last Decade

Tien Mai

27 papers receiving 415 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Tien Mai Singapore 9 345 184 94 58 48 31 434
Hongli Xu China 7 285 0.8× 112 0.6× 145 1.5× 41 0.7× 9 0.2× 22 410
Mahdieh Allahviranloo United States 12 301 0.9× 23 0.1× 178 1.9× 153 2.6× 37 0.8× 34 464
Weifeng Li China 12 258 0.7× 21 0.1× 120 1.3× 90 1.6× 24 0.5× 50 398
Milenko Vrtic Switzerland 10 231 0.7× 90 0.5× 97 1.0× 57 1.0× 16 0.3× 34 306
P E Firmin United Kingdom 6 249 0.7× 71 0.4× 65 0.7× 139 2.4× 16 0.3× 9 356
Eyran J. Gisches United States 11 282 0.8× 129 0.7× 113 1.2× 37 0.6× 68 1.4× 21 437
Rodrigo Acuña-Agost France 9 140 0.4× 47 0.3× 42 0.4× 29 0.5× 51 1.1× 17 377
Virginie Lurkin Switzerland 11 136 0.4× 89 0.5× 88 0.9× 52 0.9× 69 1.4× 34 357
Joaquín de Chile 11 626 1.8× 71 0.4× 355 3.8× 149 2.6× 28 0.6× 14 672
Milad Ghasri Australia 10 163 0.5× 23 0.1× 86 0.9× 137 2.4× 17 0.4× 37 373

Countries citing papers authored by Tien Mai

Since Specialization
Citations

This map shows the geographic impact of Tien Mai's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tien Mai with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tien Mai more than expected).

Fields of papers citing papers by Tien Mai

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tien Mai. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tien Mai. The network helps show where Tien Mai may publish in the future.

Co-authorship network of co-authors of Tien Mai

This figure shows the co-authorship network connecting the top 25 collaborators of Tien Mai. A scholar is included among the top collaborators of Tien Mai based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Tien Mai. Tien Mai is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Mai, Tien, et al.. (2024). Network-based representations and dynamic discrete choice models for multiple discrete choice analysis. Transportation Research Part B Methodological. 184. 102948–102948. 1 indexed citations
2.
Mai, Tien, et al.. (2024). Imitate the Good and Avoid the Bad: An Incremental Approach to Safe Reinforcement Learning. Proceedings of the AAAI Conference on Artificial Intelligence. 38(11). 12439–12447. 1 indexed citations
3.
Mai, Tien, et al.. (2024). Constrained Assortment Optimization Under the Cross-Nested Logit Model. Production and Operations Management. 33(10). 2073–2090. 1 indexed citations
4.
Mai, Tien, et al.. (2023). Estimation of recursive route choice models with incomplete trip observations. Transportation Research Part B Methodological. 173. 313–331. 3 indexed citations
5.
Mai, Tien, et al.. (2023). Joint location and cost planning in maximum capture facility location under random utilities. Computers & Operations Research. 159. 106336–106336. 1 indexed citations
6.
Mai, Tien, et al.. (2023). Imitation Improvement Learning for Large-Scale Capacitated Vehicle Routing Problems. Proceedings of the International Conference on Automated Planning and Scheduling. 33(1). 551–559. 1 indexed citations
7.
Mai, Tien, et al.. (2023). Robust maximum capture facility location under random utility maximization models. European Journal of Operational Research. 310(3). 1128–1150. 8 indexed citations
8.
Mai, Tien & Arunesh Sinha. (2023). Securing Lifelines: Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach. Proceedings of the AAAI Conference on Artificial Intelligence. 37(5). 5805–5813. 1 indexed citations
9.
Mai, Tien & Emma Frejinger. (2022). Undiscounted Recursive Path Choice Models: Convergence Properties and Algorithms. Transportation Science. 56(6). 1469–1482. 8 indexed citations
10.
Mai, Tien, et al.. (2022). A Logistic Regression and Linear Programming Approach for Multi-Skill Staffing Optimization in Call Centers. 2022 Winter Simulation Conference (WSC). 3087–3098.
11.
Mai, Tien, et al.. (2022). Joint chance-constrained staffing optimization in multi-skill call centers. Journal of Combinatorial Optimization. 44(1). 354–378. 2 indexed citations
12.
Mai, Tien, et al.. (2022). Estimation of Recursive Route Choice Models with Incomplete Trip Observations. SSRN Electronic Journal.
13.
Mai, Tien, et al.. (2021). Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm. Transportation Research Part B Methodological. 151. 42–58. 12 indexed citations
14.
Mai, Tien, et al.. (2020). Route choice behaviour and travel information in a congested network: Static and dynamic recursive models. Transportation Research Part C Emerging Technologies. 114. 681–693. 33 indexed citations
15.
Mai, Tien & Andrea Lodi. (2019). An Algorithm for Assortment Optimization Under Parametric Discrete Choice Models. SSRN Electronic Journal. 1 indexed citations
16.
Mai, Tien, Fabian Bastin, & Emma Frejinger. (2016). A decomposition method for estimating recursive logit based route choice models. EURO Journal on Transportation and Logistics. 7(3). 253–275. 33 indexed citations
17.
Mai, Tien, et al.. (2016). Bike route choice modeling using GPS data without choice sets of paths. Transportation Research Part C Emerging Technologies. 75. 183–196. 120 indexed citations
18.
Mai, Tien, Emma Frejinger, & Mogens Fosgerau. (2015). A nested recursive logit model for route choice analysis. Munich Personal RePEc Archive (Ludwig Maximilian University of Munich).
19.
Mai, Tien, Emma Frejinger, Mogens Fosgerau, & Fabian Bastin. (2015). A dynamic programming approach for quickly estimating large scale MEV models. 2 indexed citations
20.
Mai, Tien, Emma Frejinger, & Fabian Bastin. (2015). Comparing regret minimization and utility maximization for route choice using the recursive logit model. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026