Abstract
This paper deals with the problem of locating concentrators in a computer communications network where the terminals have varying concentrator coverage. A mathematical programming model is developed. The objective is to minimize communication costs as well as set up and operating costs for the concentrators subject to capacity constraints. A solution procedure which makes use of a relaxation of the problem is presented. Computational results indicate that this solution procedure is very effective.
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 callDisclaimer: 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.
