Jul 2026
A Dual-Guided Exact Algorithm for the Two-Constraint Path Problem
A dual-guided exact algorithm that effectively bridges the gap between the computational efficiency of Lagrangian relaxation and the optimality guarantees of combinatorial search and reduces the execution time by orders of magnitude compared to traditional exact methods.
Kaixiang Hu, Xian-Kai Li, Caixia Kou
· International Journal of Fou... · 0 citations