[1] Kuhn H., Tucker W. A.: Linear Inequalities and Related Systems. Princeton Univ. Press, Princeton, N. J. 1956. MR 0082913 | Zbl 0072.37502

[2] Grünbaum B.: Convex Polytopes. Interscience Publishers, London-New York-Sydney 1967. MR 0226496

[3] Berge C.: Théorie des graphes et ses applications. Dunod, Paris 1958. MR 0102822

[4] Ore O.: Theory of Graphs. American Mathematical Society, Colloquium Publications 38 (1962). MR 0150753 | Zbl 0105.35401

[5] Morávek J.: On the Complexity of Discrete Programming Problems. Aplikace matematiky 14 (1969), 6, 442-474. MR 0253745

[6] Morávek J.: A Note Upon Minimal Path Problem. Journal of Mathematical Analysis and Appl. 30 (June 1970), 3, 702-717. MR 0278984 | Zbl 0175.17703

[7] Bellman R.: Dynamic Programming Treatment of the Travelling Salesman Problem. J. Assoc. Comput. Mach. 9 (1962), 1, 61-63. MR 0135702 | Zbl 0106.14102

[8] Held M., Karp R. M.: A Dynamic Programming Approach to Sequencing Problems. J. Soc. Industr. and Appl. Math. 10 (1962), 1, 196-210. MR 0139493 | Zbl 0106.14103

[9] Edmonds J.: Paths, Trees and Flowers. Canad. J. Math. 17 (1965), 449-467. MR 0177907 | Zbl 0132.20903