Vehicle routing on road networks: How good is Euclidean approximation? - Burak Boyaci; Thu Huong Dang; Adam N. Letchford (Comput. Oper. Res., 2021)

On matchings, T-joins, and arc routing in road networks. - Burak Boyaci; Thu Huong Dang; Adam N. Letchford (Networks, 2022)

Improving a constructive heuristic for the general routing problem. - Burak Boyaci; Thu Huong Dang; Adam N. Letchford (Networks, 2023)

Fast upper and lower bounds for a large-scale real-world arc routing problem. - Burak Boyaci; Thu Huong Dang; Adam N. Letchford (Networks, 2023)

On some lower bounds for the permutation flowshop problem. - Sebastian Cáceres Gelvez; Thu Huong Dang; Adam N. Letchford (Comput. Oper. Res., 2023)

Hybridising Reinforcement Learning and Heuristics for Hierarchical Directed Arc Routing Problems. - Van Quang Nguyen; Quoc Chuong Nguyen; Thu Huong Dang; Truong-Son Hy (CoRR, 2025)