//-->
Branch-and-cut algorithms for the p-arborescence star problem
Pereira, Armando Honorio, (2022)
A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem
Li, Xiangyong, (2012)
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems
Akyüz, M. Hakan, (2013)
Flow shop scheduling to minimize the total completion time with a permanently present operator : models and ant colony optimization metaheuristic
Li, Xiangyong, (2011)
An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem
Li, Xiangyong, (2010)
Using branch-and-price approach to solve the directed network design problem with relays