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

DOI10.1142/S0217595910002946zbMath1230.90191MaRDI QIDQ3074795

No author found.

Publication date: 10 February 2011

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

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)

Related Items (4)

ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET ⋮ Enumerating \(K\) best paths in length order in DAGs ⋮ An efficient time and space \(K\) point-to-point shortest simple paths algorithm ⋮ On the \(K\) shortest path trees problem

Cites Work

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

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