Shortest chain subject to side constraints
Y.P. Aneja, Vijay Aggarwal, K. P. K. Nair · Networks · 1983
Abstract Certain properties of a shortest chain subject to several side constraints are established. Based on these an implicit enumeration algorithm, that is, a generalization of the one given by Dijkstra for the case without any side constraint, is presented. Validation of the algorithm and an illustrative example are included.