
AbstractAn 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.
Extremal problems in graph theory, Numerical mathematical programming methods, Deterministic network models in operations research, Programming involving graphs or networks
Extremal problems in graph theory, Numerical mathematical programming methods, Deterministic network models in operations research, Programming involving graphs or networks
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 17 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
