| On the min-cost traveling salesman problem with drone QM Ha, Y Deville, QD Pham, MH Hà Transportation Research Part C: Emerging Technologies 86, 597-621, 2018 | 607 | 2018 |
| A hybrid genetic algorithm for the traveling salesman problem with drone QM Ha, Y Deville, QD Pham, MH Hà Journal of Heuristics 26, 219-247, 2020 | 161 | 2020 |
| The min-cost parallel drone scheduling vehicle routing problem MA Nguyen, GTH Dang, MH Hà, MT Pham European Journal of Operational Research 299 (3), 910-930, 2022 | 90 | 2022 |
| An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices MH Ha, N Bostel, A Langevin, LM Rousseau European Journal of Operational Research 226 (2), 211-220, 2013 | 77 | 2013 |
| An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size MH Hà, N Bostel, A Langevin, LM Rousseau Computers & Operations Research 43, 9-19, 2014 | 65 | 2014 |
| Heuristic methods for the traveling salesman problem with drone QM Ha, Y Deville, QD Pham, MH Ha arXiv preprint arXiv:1509.08764, 2015 | 64 | 2015 |
| Optimizing road network daily maintenance operations with stochastic service and travel times L Chen, MH Hà, A Langevin, M Gendreau Transportation Research Part E: Logistics and Transportation Review 64, 88-102, 2014 | 59 | 2014 |
| The Vehicle Routing Problem with Service Level Constraints T Bulhões, MH Hà, R Martinelli, T Vidal European Journal of Operational Research 265 (2), 544-558, 2018 | 58 | 2018 |
| A robust optimization approach for the road network daily maintenance routing problem with uncertain service time L Chen, M Gendreau, MH Hà, A Langevin Transportation research part E: logistics and transportation review 85, 40-51, 2016 | 53 | 2016 |
| Solving the close‐enough arc routing problem MH Ha, N Bostel, A Langevin, LM Rousseau Networks 63 (1), 107-118, 2014 | 44 | 2014 |
| Toward a more flexible VRP with pickup and delivery allowing consolidations Y Ancele, MH Hà, C Lersteau, DB Matellini, TT Nguyen Transportation Research Part C: Emerging Technologies 128, 103077, 2021 | 34 | 2021 |
| Solving the multi-vehicle multi-covering tour problem TA Pham, MH Hà, XH Nguyen Computers & operations research 88, 258-278, 2017 | 34 | 2017 |
| The two‐echelon routing problem with truck and drones L Vu, DM Vu, MH Hà, VP Nguyen International Transactions in Operational Research 29 (5), 2968-2994, 2022 | 29 | 2022 |
| A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints MH Hà, TD Nguyen, TN Duy, HG Pham, T Do, LM Rousseau Computers & Operations Research 124, 105085, 2020 | 24 | 2020 |
| Solving the clustered traveling salesman problem with‐relaxed priority rule MH Hà, H Nguyen Phuong, H Tran Ngoc Nhat, A Langevin, M Trépanier International Transactions in Operational Research 29 (2), 837-853, 2022 | 23* | 2022 |
| An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints. MH Ha, N Bostel, A Langevin, LM Rousseau ICORES, 233-238, 2012 | 23 | 2012 |
| Ants can solve the parallel drone scheduling traveling salesman problem QT Dinh, DD Do, MH Hà Proceedings of the Genetic and Evolutionary Computation Conference, 14-21, 2021 | 22 | 2021 |
| Solving the k-dominating set problem on very large-scale networks MH Nguyen, MH Hà, DN Nguyen, TT Tran Computational Social Networks 7, 1-15, 2020 | 17 | 2020 |
| Arc routing with time-dependent travel times and paths T Vidal, R Martinelli, TA Pham, MH Hà Transportation Science 55 (3), 706-724, 2021 | 16 | 2021 |
| The vehicle routing problem with relaxed priority rules TT Doan, N Bostel, MH Hà EURO Journal on Transportation and Logistics 10, 100039, 2021 | 14 | 2021 |
Andre LangevinEcole Polytechnique de Montréal在 polymtl.ca 的电子邮件经过验证
