Abstract
This paper is concerned with the problem of constructing a minimal cost weighted tree connecting a set ofn given terminal vertices on an Euclidean plane. Both theoretical and numerical aspect of the problem are considered. As regards the first ones, the convexity of the objective function is studied and the necessary and sufficient optimality conditions are deduced. As regards the numerical aspects, a subgradient type algorithm is presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
