Skip to main content
SpringerLink
Log in

On the solution of the generalized steiner problem by the subgradient method

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

This paper is concerned with the problem of constructing a minimal cost weighted tree connecting a set ofn given terminal vertices on an Euclidean plane. Both theoretical and numerical aspect of the problem are considered. As regards the first ones, the convexity of the objective function is studied and the necessary and sufficient optimality conditions are deduced. As regards the numerical aspects, a subgradient type algorithm is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Brezis H. (1983) Analyse Fonctionelle. Ed. Masson

  • Francis R. L., Goldstein J. M. (1973) Location Theory: A Selective Bibliography. Op. Research 21: 400–410

    Google Scholar 

  • Frank H., Chou W. (1972) Topological Optimization of Computer Networks. Proc. IEEE 60: 1385–1397

    Google Scholar 

  • Gilbert E. N., Pollak O., (1968) Steiner Minimal Trees. SIAM J. Appl. Math. 16: 1–29

    Google Scholar 

  • Miehle W. (1985) Link-lenght Minimization in Networks. Op. Research 6: 232–243

    Google Scholar 

  • Minoux M. (1986). Mathematical Programming-Theory and Algorithms. J. Wiley & Sons, New York

    Google Scholar 

  • Kuhn H. W., Kuenne R. E. (1962) An Efficient Algorithm for the Numerical Solution of the Generalized Weber problem in Spatial Economics. Jour. of Reg. Sci. 4: 21–33

    Google Scholar 

  • Rockafellar R. T. (1970) Convex Analysis. Princeton University Press, New York

    Google Scholar 

  • Shor N. Z. (1985) Minimization Method for Non-Differentiable Functions. Springer Verlag, Berlin

    Google Scholar 

  • Trietsch D. (1985) Augmenting Euclidean Networks —The Steiner case. SIAM J. Appl. Math. 45: 855–860

    Google Scholar 

  • Wendell R., Hurter A. P. (1979) Location theory, Dominance and Convexity. Op. Research 22: 314–320

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. di Matematica, Universitá di Pisa, Italy

    F. Donno

  2. Dip. Metodi e Modelli Matematici, Universitá “La Sapienza”, Via A. Scarpa 10, 00161, Roma, Italy

    G. Pesamosca

Authors
  1. F. Donno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Pesamosca
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Donno, F., Pesamosca, G. On the solution of the generalized steiner problem by the subgradient method. ZOR - Methods and Models of Operations Research 34, 335–352 (1990). https://doi.org/10.1007/BF01416225

Download citation

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01416225

Keywords

Search

Navigation