| Vehicle routing on road networks: How good is Euclidean approximation? B Boyacı, TH Dang, AN Letchford Computers & Operations Research 129, 105197, 2021 | 23 | 2021 |
| On matchings, T‐joins, and arc routing in road networks B Boyacı, TH Dang, AN Letchford Networks 79, 20-31, 2022 | 4 | 2022 |
| Improving a constructive heuristic for the general routing problem B Boyacı, TH Dang, AN Letchford Networks 81 (1), 93-106, 2023 | 3 | 2023 |
| 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 | 2 | 2023 |
| On some lower bounds for the permutation flowshop problem SC Gelvez, TH Dang, AN Letchford Computers & Operations Research, 106320, 2023 | | 2023 |
| 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 |
| Exact and Heuristic Approaches to Arc Routing Problems T Dang Lancaster University, 2022 | | 2022 |
| The Travelling Salesman on Road Networks: How Good is Euclidean Approximation? B Boyacı, TH Dang, AN Letchford | | 2020 |
Burak BoyacıCentre for Transport and Logistics (CENTRAL), Lancaster Universitylancaster.ac.uk의 이메일 확인됨
