Previous |  Up |  Next

Article

Title: A localization problem in geometry and complexity of discrete programming (English)
Title: Lokalizační problém v geometrii a složitost diskrétního programování (Czech)
Author: Morávek, Jaroslav
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 8
Issue: 6
Year: 1972
Pages: (498)-516
Summary lang: Czech
.
Category: math
.
MSC: 68A20
MSC: 90C25
MSC: 90C99
idZBL: Zbl 0248.90044
idMR: MR0395873
.
Date available: 2009-09-24T16:28:59Z
Last updated: 2012-06-04
Stable URL: http://hdl.handle.net/10338.dmlcz/124660
.
Reference: [1] Kuhn H., Tucker W. A.: Linear Inequalities and Related Systems.Princeton Univ. Press, Princeton, N. J. 1956. Zbl 0072.37502, MR 0082913
Reference: [2] Grünbaum B.: Convex Polytopes.Interscience Publishers, London-New York-Sydney 1967. MR 0226496
Reference: [3] Berge C.: Théorie des graphes et ses applications.Dunod, Paris 1958. MR 0102822
Reference: [4] Ore O.: Theory of Graphs.American Mathematical Society, Colloquium Publications 38 (1962). Zbl 0105.35401, MR 0150753
Reference: [5] Morávek J.: On the Complexity of Discrete Programming Problems.Aplikace matematiky 14 (1969), 6, 442-474. MR 0253745
Reference: [6] Morávek J.: A Note Upon Minimal Path Problem.Journal of Mathematical Analysis and Appl. 30 (June 1970), 3, 702-717. Zbl 0175.17703, MR 0278984
Reference: [7] Bellman R.: Dynamic Programming Treatment of the Travelling Salesman Problem.J. Assoc. Comput. Mach. 9 (1962), 1, 61-63. Zbl 0106.14102, MR 0135702
Reference: [8] Held M., Karp R. M.: A Dynamic Programming Approach to Sequencing Problems.J. Soc. Industr. and Appl. Math. 10 (1962), 1, 196-210. Zbl 0106.14103, MR 0139493
Reference: [9] Edmonds J.: Paths, Trees and Flowers.Canad. J. Math. 17 (1965), 449-467. Zbl 0132.20903, MR 0177907
.

Files

Files Size Format View
Kybernetika_08-1972-6_4.pdf 980.5Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo