Key points are not available for this paper at this time.
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.
Aneja et al. (Wed,) studied this question.