Premium
Low cost drainage networks
Author(s) -
Lee D. H.
Publication year - 1976
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230060405
Subject(s) - drainage network , drainage , computer science , mathematical optimization , graph , network planning and design , graph theory , mathematics , theoretical computer science , computer network , ecology , combinatorics , biology
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.