Designing Optimal Flow Networks

Details Designing Optimal Flow Networks Designing Optimal Flow Networks

2009-03-12

arxiv.org/abs/0903.2124v1

Mathematics

Optimization and Control

6 pages, 2 columns, 4 figures

Scientific paper

We investigate the problem of designing a minimum cost flow network interconnecting n sources and a single sink, each with known locations and flows. The network may contain other unprescribed nodes, known as Steiner points. For concave increasing cost functions, a minimum cost network of this sort has a tree topology, and hence can be called a Minimum Gilbert Arborescence (MGA). We characterise the local topological structure of Steiner points in MGAs for linear cost functions. This problem has applications to the design of drains, gas pipelines and underground mine access.

Affiliated with

Also associated with

No associations

Rating

Designing Optimal Flow Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Designing Optimal Flow Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Designing Optimal Flow Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36151