Abstract
A typical technical problem leading to a minimum cost network is the design of a communication or transportation system connecting several places. Usually certain costs are assigned to each connection line. These costs can be either investment costs or operating costs or a combination of both. In this paper are shown the first results of investigation of this problem with the costs of the network nonlinearly dependent of the structure of the network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chang, S.K.: Generation of Minimal Trees with a Steiner-topology, J.ACM., 19 4(1972), 699–711.
Cockayne, E.J.: Computation of minimal length full Steiner trees on the vertices of a convex polygon, Math.Comp. 23, 107(1969), 521–531.
Cockayne, E.J.: On the Steiner problem, Canad.Math. Bull. 10(1967), 431–450.
Cockayne, E.J.: On the efficiency of algorithms for Steiner minimal trees, SIAM J.Appl.Math. 18, 1(1970), 150–159.
Cockayne, E.J. and Melzak, Z.A.: Steiner’s problem for set terminals, Quart.Appl.Math. 26, 2(1968), 213–218.
Gilbert, E.N., Minimum cost communication networks, Bell System Tech.J. 46(1967), 2209–2227.
Gilbert, E.N. and Pollak, H.O., Steiner minimal trees, SIAM J.Appl.Math. 16, 1(1968), 1–29.
Hanan, M.: On Steiner’s problem with rectilinear distance, SIAM J.Appl.Math. 14, 2(1966), 255–265.
Kruskal, J.B. Jr.: On the shortest spanning subtree of a graph and the traveling salesman problem, Proc.Amer.Math.Soc., 7(1956), 48–50.
Melzak, Z.A.: On the problem of Steiner, Canad.Math. Bull. 4(1961), 143–148.
Prim, R.C.: Shortest connection networks and some generalizations, Bell System Tech.J., 36(1957), 110–112.
Soukup, J.: On minimum cost networks with nonlinear cost, SIAM J.Appl.Math. 29, 4(1975), 571–581.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer Basel AG
About this chapter
Cite this chapter
van der Heyden, W.P.A. (1977). Some experiments with Steiner trees. In: Collatz, L., Meinardus, G., Wetterling, W. (eds) Numerische Methoden bei Optimierungsaufgaben Band 3. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série Internationale D’Analyse Numérique, vol 36. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-5936-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-0348-5936-3_6
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-5937-0
Online ISBN: 978-3-0348-5936-3
eBook Packages: Springer Book Archive