Abstract
This paper proposes a new variant of a label correcting polynomially bounded and computationally efficient shortest path algorithm, called the partitioning shortest path (PSP) algorithm. This variant, called the Extended PSP algorithm, provides a new rule for selecting scan eligible nodes to scan which has promising computational properties, particularly when shortest path algorithms are employed in relaxation strategies. In addition, results are established for this variant which provide a percent of optimality solution procedure.
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.
