In this paper we develop a Lagrangian relaxation algorithm for the problem of finding a shortest path between two nodes in a network, subject to a knapsack-type constraint. For example, we may wish to find a minimum cost route subject to a total time constraint in a multimode transportation network. Furthermore, the problem, which is shown to be at least asâ€¦Â (More)

@article{Handler1980ADA,
title={A dual algorithm for the constrained shortest path problem},
author={Gabriel Y. Handler and Israel Zang},
journal={Networks},
year={1980},
volume={10},
pages={293-309}
}