| Article ID: | iaor20012551 |
| Country: | United Kingdom |
| Volume: | 2 |
| Issue: | 1 |
| Start Page Number: | 47 |
| End Page Number: | 70 |
| Publication Date: | Jan 2000 |
| Journal: | International Journal of Mathematical Algorithms |
| Authors: | Smith J. Macgregor |
| Keywords: | Steiner problem, packing |
The complex problem of designing the layout and location of activities and the flow network connecting them is examined. We present an algorithm which integrates a quadratic set packing approach with a Steiner tree algorithm on a graph for this composite problem. Properties of the problem along with computational results are presented.