Comparative analysis of new simplex-type algorithms for shortest path problems

MaRDI QIDQ5455218zbMATH OpenFDO

Authors

Publication date 3 April 2008

zbMATH Keywords

computational analysis

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Recommendations

• SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY
• Shortest‐path methods: Complexity, interrelations and new propositions
• scientific article; zbMATH DE number 1003284
• scientific article; zbMATH DE number 3952519
• Shortest paths algorithms: Theory and experimental evaluation

Cited in

(7)

• Shortest‐path methods: Complexity, interrelations and new propositions
• scientific article; zbMATH DE number 3952519 (Why is no real title available?)
• scientific article; zbMATH DE number 1530231 (Why is no real title available?)
• Shortest path algorithms: A computational study with the C programming language
• Implementation and analysis of alternative algorithms for generalized shortest path problems
• scientific article; zbMATH DE number 1560338 (Why is no real title available?)
• SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY

This page was built for publication: Comparative analysis of new simplex-type algorithms for shortest path problems

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