Low cost drainage networks
- 1 January 1976
- Vol. 6 (4) , 351-371
- https://doi.org/10.1002/net.3230060405
Abstract
An approach to reducing the cost of drainage networks, such as plumbing networks in buildings, is described. The drain design problem is modelled as a specialized mathematical network called a drainage network; it is shown to be related to the Steiner problem in a directed graph. A procedure which yields a good approximation to the minimum cost drainage network is described. The theoretical solution is implemented in practice via an interactive computer routine which allows for the network to be fitted to the real building. Examples of the application of the approach are given.Keywords
This publication has 12 references indexed in Scilit:
- Statistical Methods for the Detection of a Centre of Symmetry in a CrystalInternational Journal of Mathematical Education in Science and Technology, 1972
- The Generation of Minimal Trees with a Steiner TopologyJournal of the ACM, 1972
- Algorithm 422: minimal spanning tree [H]Communications of the ACM, 1972
- On the Efficiency of the Algorithm for Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1970
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICSJournal of Regional Science, 1962
- On the Problem of SteinerCanadian Mathematical Bulletin, 1961
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956