×

A dual algorithm for the constrained shortest path problem. (English) Zbl 0453.68033


MSC:

68R10 Graph theory (including graph drawing) in computer science
05C38 Paths and cycles
94C15 Applications of graph theory to circuits and networks
68Q25 Analysis of algorithms and problem complexity
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Introduction to Approximation Theory, McGraw-Hill, New York, 1966. · Zbl 0161.25202
[2] Graph Theory: An Algorithmic Approach, Academic, New York, 1975. · Zbl 0321.94011
[3] Dijkstra, Numer. Math. 1 pp 269– (1959)
[4] ”Lagrangean Relaxation Methods for Combinatorial Optimization,” Research Paper 78–10–06, Department of Decision Sciences, Wharton School, University of Pennsylvania, 1978.
[5] Fisher, SIAM J. Appl. Math. 27 pp 31– (1974)
[6] Geoffrion, Math. Program. Study 1 pp 82– (1974)
[7] Gomory, Proc. Natl. Acad. Sci. 53 pp 260– (1965)
[8] and , ”A Dual Algorithm for the Constrained Shortest Path Problem,” Working Paper 571/78, Faculty of Management, Tel-Aviv University, 1978.
[9] Joksch, J. Math. Anal. Appl. 14 pp 191– (1966)
[10] Karp, Networks 5 pp 45– (1975)
[11] ”Optimization for Sparse Systems,” in Sparse Matrix Computations, and , Eds., Academic, New York, 1976, pp. 147–176.
[12] Magnanti, Manage. Sci. 22 pp 1195– (1976)
[13] ”A Survey of Lagrangean Techniques for Discrete Optimization,” Technical Report No. 133, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, 1977.
[14] Shier, Networks 6 pp 205– (1976)
[15] Yen, Manage. Sci. 17 pp 711– (1971)
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.