Abstract
This paper reviews some recent contributions by the authors and their associates and highlights a few innovative ideas, which led them to address some hard combinatorial network routing and ordered optimisation problems. The travelling salesman, which is in the NP hard category, has been reviewed and solved as an index-restricted shortest connected graph, and therefore, it opens a question about its ‘NP Hard’ category. The routing problem through ‘K’ specified nodes and ordered optimum solutions are computationally demanding but have been made computationally feasible. All these approaches are based on the strategic creation and use of an alternative solution in that situation. The efficiency of these methods requires further investigation.
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.
