A localization problem in geometry and complexity of discrete programming
Kybernetika (1972)
- Volume: 08, Issue: 6, page (498)-516
- ISSN: 0023-5954
Access Full Article
topHow to cite
topReferences
top- Kuhn H., Tucker W. A., Linear Inequalities and Related Systems, Princeton Univ. Press, Princeton, N. J. 1956. (1956) Zbl0072.37502MR0082913
- Grünbaum B., Convex Polytopes, Interscience Publishers, London-New York-Sydney 1967. (1967) MR0226496
- Berge C., Théorie des graphes et ses applications, Dunod, Paris 1958. (1958) MR0102822
- Ore O., Theory of Graphs, American Mathematical Society, Colloquium Publications 38 (1962). (1962) Zbl0105.35401MR0150753
- Morávek J., On the Complexity of Discrete Programming Problems, Aplikace matematiky 14 (1969), 6, 442-474. (1969) MR0253745
- Morávek J., A Note Upon Minimal Path Problem, Journal of Mathematical Analysis and Appl. 30 (June 1970), 3, 702-717. (1970) Zbl0175.17703MR0278984
- Bellman R., Dynamic Programming Treatment of the Travelling Salesman Problem, J. Assoc. Comput. Mach. 9 (1962), 1, 61-63. (1962) Zbl0106.14102MR0135702
- Held M., Karp R. M., A Dynamic Programming Approach to Sequencing Problems, J. Soc. Industr. and Appl. Math. 10 (1962), 1, 196-210. (1962) Zbl0106.14103MR0139493
- Edmonds J., Paths, Trees and Flowers, Canad. J. Math. 17 (1965), 449-467. (1965) Zbl0132.20903MR0177907