Computing the minimum cost pipe network interconnecting one sink and many sources

SIAM Journal on Optimization

Volumn 10, Issue 1, 1999, Pages 22-42

  Xue, Guoliang ^a   Lillys, Theodore P ^a,b   Dougherty, David E ^a  

^a University of Vermont   (United States)

^b HYDROGEOLOGIC INC   (United States)

Author keywords

Backtrack; Bounding theorem; Generalized steiner minimum tree problem; Interior point methods; k optimal; Minimum cost pipe network

Indexed keywords

EID: 0033261255     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623496313684     Document Type: Article

References (36)

1. K.D. ANDERSEN, An efficient Newton barrier method for minimizing a sum of Euclidean norms, SIAM J. Optim., 6 (1996), pp. 74-95.
2. K.D. ANDERSEN AND E. CHRISTIANSEN, A Symmetric Primal-Dual Newton Method for Minimizing a Sum of Norms, Manuscript, Odense University, Denmark, 1995.
3. S. BHASKARAN AND F.J.M. SALZBORN, Optimal design of gas pipeline network, J. Oper. Res. Soc., 30 (1979), pp. 1047-1060.
4. P.H. CALAMAI AND A.R. CONN, A stable algorithm, for solving the multifacility location problem involving Euclidean distances, SIAM J. Sci. Stat. Comput., 1 (1980), pp. 512-526.
5. P.H. CALAMAI AND A.R. CONN, A projected Newton method for lp norm location problems, Math. Programming, 38 (1987), pp. 75-109.
6. E. J. COCKAYNE AND D.E. HEWGILL, Exact computation of Steiner minimal trees in the plane, Inform. Process. Lett., 22 (1986), pp. 151-156.
7. E.J. COCKAYNE AND D.E. HEWGILL, Improved computation of plane Steiner minimal trees, Algorithmica, 7 (1992), pp. 219-229.
8. A.R. CONN AND M.L. OVERTON, A Primal-Dual Interior Point Method for Minimizing a Sum of Euclidean Distances, manuscript, 1994.
9. D.R. DREYER AND M.L. OVERTON, Two heuristics for the Steiner tree problem, J. Global Optim., 13 (1998), pp. 95-106.
10. D.Z. DU AND F.K. HWANG, An approach for proving lower bounds: solution of Gilbert-Pollak conjecture on Steiner ratio, in Proceedings of 31st IEEE Foundations of Computer Science, 1990, pp. 76-85.
11. D.Z. Du, Y. J. ZHANG, AND Q. FENG, On better heuristic for Euclidean Steiner minimum trees, in Proceedings of 32nd IEEE Foundations of Computer Science, 1991, pp. 431-439.
12. M.R. GAREY, R.L. GRAHAM, AND D.S. JOHNSON, The complexity of computing Steiner minimal trees, SIAM J. Appl. Math., 32 (1977), pp. 835-859.
13. E.N. GILBERT, Minimum cost communication networks, Bell System Tech. J., 46 (1967), pp. 2209-2227.
14. E.N. GILBERT AND H.O. POLLAK, Steiner minimal trees, SIAM J. Appl. Math., 16 (1968), pp. 1-29.
15. F. HARARY, Graph Theory, Addison-Wesley, New York, 1969.
16. F.K. HWANG, A primer of the Euclidean Steiner problem, Ann. Oper. Res., 33 (1991), pp. 73-84.
17. F.K. HWANG, D.S. RICHARD, AND P. WINTER, The Steiner Tree Problem, Ann. Discrete Math. 53, North-Holland, Amsterdam, 1992.
18. E. HOROWITZ AND S. SAHNI, Fundamentals of Computer Algorithms, Computer Science Press, Rockville, MD, 1978.
19. D.H. LEE, Low cost drainage networks, Networks, 6 (1976), pp. 351-371.
20. T.P. LILLYS, Optimal Piping Networks for Sub-Surface Remediation Designs, M.S. thesis, Department of Civil and Environmental Engineering, University of Vermont, Burlington, 1997.
21. Z.A. MELZAK, On the problem of Steiner, Canad. Math. Bull., 4 (1961), pp. 143-148.
22. YU. E. NESTEROV AND A. NEMIROVSKII, Interior Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, 1994.
23. YU. E. NESTEROV AND M. J. TODD, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res., 22 (1997), pp. 1-42.
24. M.L. OVERTON, A quadratically convergent method for minimizing a sum of Euclidean norms, Math. Programming, 27 (1983), pp. 34-63.
25. M.L. OVERTON AND G.L. XUE, private communications, February 1996.
26. R.C. PRIM, Shortest connection networks and some generalizations, Bell System Tech. J., 36 (1967), pp. 1389-1401.
27. D.M. RIZZO AND D.E. DOUGHERTY, Design optimization for multiple management period groundwater remediation, Water Resources Research, 32 (1996), pp. 2549-2562.
28. R.T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
29. W.D. SMITH, How to find Steiner minimal trees in Euclidean d-space, Algorithmica, 7 (1992), pp. 137-177.
30. P.K. SWAMEE AND K.J. AKALANK, Explicit equations for pipe-flow problems, J. Hydraulic Engineering, ASCE, 102 (1976), pp. 657-664.
31. P. WINTER, An algorithm for the Steiner problem in the Euclidean plane, Networks, 15 (1985), pp. 323-345.
32. P. WINTER AND M. ZACHARIASEN, Large Euclidean Steiner Minimum Trees in an Hour, Technical report 96/34, http://www.diku.dk/~pawel/publications.html.
33. P. WINTER AND M. ZACHARIASEN, Large Euclidean Steiner minimum trees: An improved exact algorithm, Networks, 30 (1998), pp. 149-66.
34. G.L. XUE AND Y. Y. YE, An efficient algorithm for minimizing a sum of Euclidean norms with applications, SIAM J. Optim., 7 (1997), pp. 1017-1036.
35. Y.Y. YE, Interior-point algorithms for quadratic programming, in Recent Developments in Mathematical Programming, S. Kumar, ed., Gordon and Breach Science, New York, 1991, pp. 237-262.
36. J.Z. ZHANG AND D.T. ZHU, A bilevel programming method for pipe network optimization, SIAM J. Optim., 6 (1996), pp. 838-857.