论文信息 - Shortest chain subject to side constraints

Shortest chain subject to side constraints

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.

[1] M. Zeleny. Linear Multiobjective Programming , 1974 .

[2] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[4] Y. Aneja,et al. The constrained shortest path problem , 1978 .