A new variant of the partitioning shortest path algorithm

DOI10.1016/0166-218X(86)90082-XzbMath0589.90082MaRDI QIDQ1074506

Nancy V. Phillips

Publication date: 1986

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

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

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

Cites Work

• A branch and bound algorithm for the generalized assignment problem

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