Negative-cycle detection algorithms
Authors:
- 1 January 1996
- book chapter
- Published by Springer Nature
- Vol. 85 (2) , 349-363
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Scaling Algorithms for the Shortest Paths ProblemSIAM Journal on Computing, 1995
- A heuristic improvement of the Bellman-Ford algorithmApplied Mathematics Letters, 1993
- Shortest path algorithmsAnnals of Operations Research, 1988
- A computational study of efficient shortest path algorithmsComputers & Operations Research, 1988
- A New Polynomially Bounded Shortest Path AlgorithmOperations Research, 1985
- Computational study of an improved shortest path algorithmNetworks, 1984
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOperations Research, 1979
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation ProblemsManagement Science, 1967
- On a routing problemQuarterly of Applied Mathematics, 1958