SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY

DOI10.1142/S0217595910002946zbMATH Open1230.90191MaRDI QIDQ3074795FDOQ3074795

Authors:

Publication date: 10 February 2011

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Recommendations

• Comparative analysis of new simplex-type algorithms for shortest path problems
• Efficient Shortest Path Simplex Algorithms
• Shortest‐path methods: Complexity, interrelations and new propositions
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• scientific article; zbMATH DE number 1558116
• An improved multiobjective shortest path algorithm
• The shortest-path problem. Analysis and comparison of methods
• The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
• Shortest-path feasibility algorithms, an experimental evaluation
• On a multicriteria shortest path problem

zbMATH Keywords

shortest path problemexperimental analysismultiple pivot rulesimplex shortest path algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Cites Work

• Efficient Shortest Path Simplex Algorithms
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• Anti-stalling pivot rules for the network simplex algorithm
• A new strategy for the undirected two-commodity maximum flow problem
• An \(O(nm)\)-time network simplex algorithm for the shortest path problem

Cited In (7)

• Optimal pivot path of the simplex method for linear programming based on reinforcement learning
• Estimated and accurate system reliabilities of a maintainable computer network subject to maintenance budget
• New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels
• An efficient time and space \(K\) point-to-point shortest simple paths algorithm
• On the \(K\) shortest path trees problem
• Enumerating \(K\) best paths in length order in DAGs
• Comparative analysis of new simplex-type algorithms for shortest path problems

This page was built for publication: SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY

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