Minimum cost flow-dependent communication networks

Networks

Volumn 48, Issue 1, 2006, Pages 39-46

  Thomas, D A ^a   Weng, J F ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Communication network; Flow dependent network; Gilbert network; Steiner tree

Indexed keywords

COSTS; FUNCTION EVALUATION; HEURISTIC METHODS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; TELECOMMUNICATION LINKS; TREES (MATHEMATICS);

COMMUNICATION NETWORK; FLOW-DEPENDENT NETWORK; GILBERT NETWORK; STEINER TREE;

TELECOMMUNICATION NETWORKS;

EID: 33746867567     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20118     Document Type: Article

References (6)

1. C.L. Cox, Flow-dependent networks: Existence and behavior at Steiner points, Networks 31 (1998), 149-156.
2. E.N. Gilbert, Minimum cost communication networks, Bell Syst Tech J 46 (1967), 2209-2227.
3. F.H. Hwang, D.S. Richards, and P. Winter, The Steiner Tree Problem, Ann Discrete Math 53 (1992).
4. J.H. Rubinstein and D.A. Thomas, A variational approach to the Steiner network problem, Ann Oper Res 33 (1991). 481-499.
5. D. Trietsch, Minimal Euclidean networks with flow-dependent cost-the generalized Steiner trees, Discussion paper #655, CEMSMS, Northwestern University, 1985.
6. D.M. Warme, P. Winter, and M. Zachariasen, Exact algorithms for plane Steiner tree problems: A computational study, Advances in Steiner Trees, D-Z Du and J.M. Smith (Editors), Kluwer Academic Publishers, The Netherlands, 2000, pp. 81-116.