Aneja, Y. P.; Aggarwal, V.; Nair, K. P. K. Shortest chain subject to side constraints. (English) Zbl 0516.90028 Networks 13, 296-302 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 40 Documents MSC: 90B10 Deterministic network models in operations research 90C35 Programming involving graphs or networks 05C35 Extremal problems in graph theory Keywords:shortest chain; side constraints; implicit enumeration algorithm; minimal cost-flow problem; optimal solution PDFBibTeX XMLCite \textit{Y. P. Aneja} et al., Networks 13, 296--302 (1983; Zbl 0516.90028) Full Text: DOI References: [1] Aneja, Naval Res. Logist. Quart. 25 pp 549– (1978) [2] Dijkstra, Numer. Math. 1 pp 269– (1959) [3] and , Flows in Networks. Princeton University, Princeton, NJ (1962). [4] Principles of Operations Research. Prentice-Hall, Englewood Cliffs, NJ (1969). [5] Linear Multiobjective Programming. Springer, New York (1974). · Zbl 0325.90033 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.