On Some Special Network Flow Problems: The Shortest Path Tour Problems
From MaRDI portal
(Redirected from Publication:5326892)
Recommendations
- Publication:4726020
- The maximum flow problem in a network with special conditions of flow distribution
- The structure of the optimal solution set on the shortest paths for networks
- Shortest paths in a network with time-dependent flow speeds
- scientific article; zbMATH DE number 833804
- Solving min-max shortest-path problems on a network
- Performance of Shortest Path Algorithms in Network Flow Problems
- On the difficulty of some shortest path problems
- scientific article; zbMATH DE number 1962826
Cites work
- A note on two problems in connexion with graphs
- An Auction Algorithm for Shortest Paths
- Buckets, Heaps, Lists, and Monotone Priority Queues
- Dynamic programming and optimal control. Vol. 1.
- Graph collapsing in shortest path auction algorithms
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Negative-cycle detection algorithms
- Network flows. Theory, algorithms, and applications.
- Polynomial auction algorithms for shortest paths
- Properties of Labeling Methods for Determining Shortest Path Trees
- Reducibility among combinatorial problems
- Shortest path auction algorithm without contractions using virtual source concept
- Shortest path methods: A unifying approach
- Shortest paths algorithms: Theory and experimental evaluation
- Shortest-path algorithms: Taxonomy and annotation
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
This page was built for publication: On Some Special Network Flow Problems: The Shortest Path Tour Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326892)
