Exact and heuristic algorithms for the Euclidean Steiner tree problem
In this thesis, we study the Euclidean Steiner tree problem (ESTP) which arises in the field of combinatorial optimization. The ESTP asks for a network of minimal total edge length spanning a set of given terminal points in Rd with the ability to add auxiliary connecting points (Steiner points) to d...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
University of Iowa
2010
|
| Subjects: | |
| Online Access: | https://ir.uiowa.edu/etd/755 https://ir.uiowa.edu/cgi/viewcontent.cgi?article=1940&context=etd |