@article{Aneja1983ShortestCS,
title={Shortest chain subject to side constraints},
author={Yash P. Aneja and V. Aggarwal and Kunhiraman Nair},
journal={Networks},
year={1983},
volume={13},
pages={295-302}
}

A shortest chain from a source to a sink in a general network is of interest in many ways [3, 41 and efficient algorithms are available for finding such a chain. In certain contexts side constraints on travel time, energy, or other resources consumed along the chain may be relevant. The shortest-chain problem subject to side constraints is known to be NP-complete. Moreover, the constraint matrix is not unimodular, and therefore a linear programming algorithm would not, in general, guarantee anâ€¦Â CONTINUE READING