Abstract
The problem is concerned with designing of wide area computer networks. This problem is very important from practical point of view because the network, when designed efficiently, can and does become the lifeblood of a business organization. The problem consists in selection of the non-simultaneous single commodity flow routes, channel capacities and the wide area network topology in order to maximize the value of the min-max flow subject to the budget constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Several properties of the problem are formulated and proved. Computational results are reported.KeywordsBudget ConstraintMaximal FlowChannel CapacityExact AlgorithmApproximate AlgorithmThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
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.
