Link-Length Minimization in Networks

William Miehle
Additional contact information
William Miehle: The Institute for Cooperative Research, University of Pennsylvania, Philadelphia, Pennsylvania

Operations Research, 1958, vol. 6, issue 2, 232-243

Abstract: Three general methods are described for attacking link-length minimization problems. All methods assume a system of fixed points that are to be interconnected by a network of links the sum of whose lengths is a minimum. In the mechanical and numeric-analytic methods, the interconnections are made through a specified number of junction points whose locations are to be determined although the connections thereto are specified initially. Constraints on the variable points and weighting of links are possible. In the soap-film method, network configurations are produced directly without assuming variable points or junctions.

Date: 1958
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.6.2.232 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:6:y:1958:i:2:p:232-243

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().