Shortest paths in a lattice network: A comparative study

DOI10.1016/S0305-0548(00)00110-6MaRDI QIDQ5945319zbMATH OpenFDO

Authors Ibrahim Abdullah Ibrahim, Said M. Selim

Publication date 28 February 2002

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0305-0548(00)00110-6

zbMATH Keywords

plagiarism

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Review text

In the publisher's note in Volume 29 (2002) of this journal it is announced that this publication is substantially the same as ``Shortest paths with Euclidean distances: An explanatory model by \textit{B.L.~Golden} and \textit{M.~Ball} in Networks 8, 297-314 (1978; Zbl 0394.94040) and is therefore removed.

Recommendations

• Shortest paths in stochastic networks with ARC lengths having discrete distributions
• scientific article; zbMATH DE number 599010
• Improved sliding shortest path algorithm: performance analysis
• The shortest-path problem. Analysis and comparison of methods
• Application of topology connectedness: the storage structure of information in road network

Cited in

(7)

• Analysis of shortest paths and subscriber line lengths in telecommunication access networks
• The improved sliding shortest path algorithm
• Improved sliding shortest path algorithm: performance analysis
• Application of topology connectedness: the storage structure of information in road network
• Computational efficiency of shortest path algorithms in C language
• Shortest paths in stochastic networks with ARC lengths having discrete distributions
• Computational Science and Its Applications – ICCSA 2004

This page was built for publication: Shortest paths in a lattice network: A comparative study

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