| Vehicle routing on road networks: How good is Euclidean approximation? B Boyacı, TH Dang, AN Letchford Computers & Operations Research 129, 105197, 2021 | 42 | 2021 |
| On some lower bounds for the permutation flowshop problem SC Gelvez, TH Dang, AN Letchford Computers & Operations Research 159, 106320, 2023 | 7 | 2023 |
| On matchings, T‐joins, and arc routing in road networks B Boyacı, TH Dang, AN Letchford Networks 79, 20-31, 2022 | 7 | 2022 |
| Fast upper and lower bounds for a large‐scale real‐world arc routing problem B Boyacı, TH Dang, AN Letchford Networks 81 (1), 107-124, 2023 | 5 | 2023 |
| Improving a constructive heuristic for the general routing problem B Boyacı, TH Dang, AN Letchford Networks 81 (1), 93-106, 2023 | 5 | 2023 |
| Exact and heuristic approaches to arc routing problems T Dang | 1 | 2022 |
| MIP-based local search for permutation flowshop scheduling with makespan objective SC Gelvez, TH Dang, AN Letchford Computers & Operations Research, 107309, 2025 | | 2025 |
| The rescheduling school bus routing problem under a constraint on the number of students with negative impact QT Dinh, TH Dang, MH Hà, DM Vu, T Mai Journal of the Operational Research Society, 1-20, 2025 | | 2025 |
| Hybridising Reinforcement Learning and Heuristics for Hierarchical Directed Arc Routing Problems VQ Nguyen, QC Nguyen, TH Dang, TS Hy arXiv preprint arXiv:2501.00852, 2025 | | 2025 |
| On some lower bounds for the permutation flowshop problem A Letchford, T Dang, S Caceres Gelvez Computers and Operations Research, 2023 | | 2023 |
| On matchings, T-joins and arc routing problems B Boyacı, T Dang, A Letchford Networks 79 (1), 20-31, 2022 | | 2022 |
| The Travelling Salesman on Road Networks: How Good is Euclidean Approximation? B Boyacı, TH Dang, AN Letchford | | 2020 |
| Improving the Semi-Lagrangian Relaxation Approach to the Simple Plant Location Problem L Durrell, TH Dang, AN Letchford | | |
| A NewApproach to Scheduling in Flowshops SC Gelvez, AN Letchford, TH Dang Delta 1, 388.19, 0 | | |
| Simple and Sparse Disjunctive Cuts for the Permutation Flowshop Problem S Cáceres-Gelvez, TH Dang, AN Letchford | | |
| Mip-Based Local Search for Permutation Flowshop Scheduling with Makespan Objective S Cáceres-Gelvez, TH Dang, AN Letchford Available at SSRN 5163914, 0 | | |
Adam N. LetchfordLancaster UniversityVerified email at lancaster.ac.uk
