Optimal networks joining n points in the plane.

Author(s)
Horn, W.A.
Year
Abstract

This report develops a number of results on the problem of connecting n points in the plane, with given travel demands between each pair, by a minimum-cost network. The critical assumptions are (a) constant construction costs per mile, (b) constant travel cost per mile per traveller, and (c) use of shortest paths in the network for all travel.

Request publication

1 + 2 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
A 5016 (In: A 4992)
Source

In: Beiträge zur Theorie des Verkehrsflusses : 4. internationalen Symposiums über die Theorie des Verkehrsflusses in Karlsruhe im Juni 1968, p. 160

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.