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

DOI10.1007/978-1-4614-3906-6_13zbMATH Open1268.90063OpenAlexW2130578390MaRDI QIDQ5326892FDOQ5326892

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

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

zbMATH Keywords

combinatorial optimizationnetwork flow problemsshortest path tour problems

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• A note on two problems in connexion with graphs
• Title not available (Why is that?)
• Reducibility among Combinatorial Problems
• Dynamic programming and optimal control. Vol. 1.
• Shortest-path algorithms: Taxonomy and annotation
• Shortest paths algorithms: Theory and experimental evaluation
• Shortest path methods: A unifying approach
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• Negative-cycle detection algorithms
• An Auction Algorithm for Shortest Paths
• Buckets, Heaps, Lists, and Monotone Priority Queues
• Polynomial auction algorithms for shortest paths
• Properties of Labeling Methods for Determining Shortest Path Trees
• Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
• Shortest path auction algorithm without contractions using virtual source concept
• Graph collapsing in shortest path auction algorithms

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)