Abstract
The routing problem is one of the studied transportation problems. In the paper the communication networks routing problem is presented. This problem is an example of mulitcriteria optimization problem which the solution is the set of non–dominated solutions. Four algorithms for determination routes belong to the set of non–dominated solutions are shown. Additionally, other routing problems that have been researched by staff of the Institute of Informatics are discussed.
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.
