A summary of the test problems used is given in Table 1. Galvo et al. A summary of the test problems used is given in Table 1. Galvo et al. A Dual Algorithm for the Constrained Shortest Path Problem .
Lagrangean surrogate bounds.
The best Lagrangean surrogate relaxation value gives an improved bound to the usual Lagrangean relaxation. G. Y. Handler and I. Zang. A dual algorithm for the constrained shortest path problem . More recently, pure dual ascent algorithms have been described to solve the problem under consideration. Lagrangean surrogate bounds.