Abstract
In this paper, various optimality problems (such as the shortest route, most reliable route and maximum capacity route problems) are studied in networks which admit a tree-like representation. A general decomposition algorithm is presented which offers important computational advantages over standard matrix-type optimality calculations. Moreover, when implemented for particular classes of decomposed networks, the general algorithm is shown to provide substantial improvements over existing decomposition methods.
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.
