Thu Huong Dang

According to our database, Thu Huong Dang authored at least 7 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

MIP-based local search for permutation flowshop scheduling with makespan objective.

Sebastian Cáceres Gelvez, Thu Huong Dang, Adam N. Letchford

Comput. Oper. Res., 2026

2025

Hybridising Reinforcement Learning and Heuristics for Hierarchical Directed Arc Routing Problems.

Van Quang Nguyen, Quoc Chuong Nguyen, Thu Huong Dang, Truong-Son Hy

CoRR, January, 2025

2023

On some lower bounds for the permutation flowshop problem.

Sebastian Cáceres Gelvez, Thu Huong Dang, Adam N. Letchford

Comput. Oper. Res., November, 2023

Fast upper and lower bounds for a large-scale real-world arc routing problem.

Burak Boyaci, Thu Huong Dang, Adam N. Letchford

Networks, January, 2023

Improving a constructive heuristic for the general routing problem.

Burak Boyaci, Thu Huong Dang, Adam N. Letchford

Networks, January, 2023

2022

On matchings, T-joins, and arc routing in road networks.

Burak Boyaci, Thu Huong Dang, Adam N. Letchford

Networks, 2022

2021

Vehicle routing on road networks: How good is Euclidean approximation?

Burak Boyaci, Thu Huong Dang, Adam N. Letchford

Comput. Oper. Res., 2021