A new variant of the partitioning shortest path algorithm

DOI10.1016/0166-218X(86)90082-XMaRDI QIDQ1074506zbMATH OpenFDO

Authors Nancy V. Phillips

Publication date 1986

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(86)90082-X

zbMATH Keywords

efficient shortest path algorithmlabel correcting polynomially bounded and computationallylabel correcting polynomially bounded and computationally efficient shortest path algorithmpartitioning shortest path algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35)

Recommendations

• A New Polynomially Bounded Shortest Path Algorithm
• A note on the partitioning shortest path algorithm
• New Polynomial Shortest Path Algorithms and Their Computational Attributes
• New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures
• Label-correcting shortest path algorithms revisisted

Cites work

• A branch and bound algorithm for the generalized assignment problem

Cited in

(6)

• A note on the partitioning shortest path algorithm
• Label-correcting shortest path algorithms revisisted
• A New Polynomially Bounded Shortest Path Algorithm
• New Polynomial Shortest Path Algorithms and Their Computational Attributes
• New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures
• An efficient label setting/correcting shortest path algorithm

This page was built for publication: A new variant of the partitioning shortest path algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1074506)