The Steiner problem is to find the shortest network linking a given set of terminals. The terminals may be in the plane or 3-space and the edges of the network may be constrained. For example, the edges of the network may be restricted to lying in a rectangular grid as in a VLSI chip or the edges of the network might be tunnels linking ore-deposits in a mine and so be gradient-constrained by haulage factors. Thus the Steiner problem has many applications.
The project on the Optimal Network Design is joint work with Prof J. Rubinstein, Department of Mathematics, Dr J. Weng, Dr P. Grossman, and Dr M Brazil, Department of Electrical & Electronic Engineering.