Geodesic
A localization problem in geometry and complexity of discrete programming
Kybernetika, Tome 8 (1972) no. 6, pp. 498-516 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 68A20, 90C25, 90C99 
@article{KYB_1972_8_6_a3,
     author = {Mor\'avek, Jaroslav},
     title = {A localization problem in geometry and complexity of discrete programming},
     journal = {Kybernetika},
     pages = {498--516},
     year = {1972},
     volume = {8},
     number = {6},
     mrnumber = {0395873},
     zbl = {0248.90044},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1972_8_6_a3/}
}
TY  - JOUR
AU  - Morávek, Jaroslav
TI  - A localization problem in geometry and complexity of discrete programming
JO  - Kybernetika
PY  - 1972
SP  - 498
EP  - 516
VL  - 8
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/KYB_1972_8_6_a3/
LA  - en
ID  - KYB_1972_8_6_a3
ER  - 
%0 Journal Article
%A Morávek, Jaroslav
%T A localization problem in geometry and complexity of discrete programming
%J Kybernetika
%D 1972
%P 498-516
%V 8
%N 6
%U http://geodesic.mathdoc.fr/item/KYB_1972_8_6_a3/
%G en
%F KYB_1972_8_6_a3
Morávek, Jaroslav. A localization problem in geometry and complexity of discrete programming. Kybernetika, Tome 8 (1972) no. 6, pp. 498-516. http://geodesic.mathdoc.fr/item/KYB_1972_8_6_a3/

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

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

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

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

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

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

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

[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 | Zbl

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