×

zbMATH — the first resource for mathematics

A note upon minimal path problem. (English) Zbl 0175.17703

PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Bellman, R.: Dynamic programming. (1957) · Zbl 0077.13605
[2] Morávek, J.: On the complexity of discrete programming problems. Apl. matematiky 14 (1969) · Zbl 0196.22804
[3] Morávek, J.: Über die algorithmische komplexität des problems der diskreten optimierung. 12th international scientific colloquy (1967) · Zbl 0207.50501
[4] Berge, C.: Théorie des graphes et ses applications. (1968) · Zbl 0214.50804
[5] Goldman, A. J.; Tucker, A. W.: Polyhedral convex cones. Linear inequalities and related systems (1956) · Zbl 0072.37504
[6] Kaufmann, A.; Desbazeille, G.: La méthode de chémin critique. (1969) · Zbl 0127.37001
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.