A dual algorithm for the constrained shortest path problem

Abstract

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)
DOI: 10.1002/net.3230100403

Topics

7 Figures and Tables

Statistics

01020'92'95'98'01'04'07'10'13'16
Citations per Year

283 Citations

Semantic Scholar estimates that this publication has 283 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@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} }