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.
For a number of reasons we prefer not to do this. For one, we don t like the idea of cluttering our shortest or k shortest path code with code for constraint violations. Gabriel Y. Handler and Israel Zang. A dual algorithm for the constrained shortest path problem . Beer Sheva 84105, Israel.