On Some Special Network Flow Problems: The Shortest Path Tour Problems

DOI10.1007/978-1-4614-3906-6_13MaRDI QIDQ5326892zbMATHOpenAlexFDO

Authors Paola Festa

Publication date 1 August 2013

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-3906-6_13

zbMATH Keywords

combinatorial optimizationnetwork flow problemsshortest path tour problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

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
• Publication:4860304
• 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

• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• 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
• 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-Route Methods: 1. Reaching, Pruning, and Buckets
• Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
• Shortest-path algorithms: Taxonomy and annotation

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)