In this paper, we consider the problem of constructing the shortest two-connected Steiner network on the Euclidean plane. For a given set P of points on the Euclidean plane, let l 2 (P) denote the length of the shortest two-connected Steiner network on P divided by the length of the shortest two-con
โฆ LIBER โฆ
Shortest paths with euclidean distances: An explanatory model
โ Scribed by B. L. Golden; M. Ball
- Publisher
- John Wiley and Sons
- Year
- 1978
- Tongue
- English
- Weight
- 648 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On shortest two-connected Steiner networ
โ
Hsu, D. Frank; Hu, Xiao-Dong
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 137 KB
๐ 1 views
Parametric shortest path algorithms with
โ
Richard M. Karp; James B. Orlin
๐
Article
๐
1981
๐
Elsevier Science
๐
English
โ 991 KB
An iterative algorithm for the multifaci
โ
Christakis Charalambous
๐
Article
๐
1981
๐
John Wiley and Sons
๐
English
โ 509 KB
An exact algorithm for the elementary sh
โ
Dominique Feillet; Pierre Dejax; Michel Gendreau; Cyrille Gueguen
๐
Article
๐
2004
๐
John Wiley and Sons
๐
English
โ 149 KB
An examination of consumer heterogeneity
โ
James H. Pedrick; Fred S. Zufryden
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 886 KB
Existence and sensitivity analysis of op
โ
Nikolaos S. Papageorgiou
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 633 KB
## Abetract-ln this paper, we examine a model of optimal economic growth with infhrite continuous time plannin g horizon, convex technology and an aggregate discounted utility. First, we establish the existence of optimal capital accumulation paths, and then we study their variations as well as th