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

DOI10.1007/978-1-4614-3906-6_13zbMath1268.90063OpenAlexW2130578390MaRDI QIDQ5326892

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Negative-cycle detection algorithms
• Shortest path auction algorithm without contractions using virtual source concept
• Polynomial auction algorithms for shortest paths
• Shortest paths algorithms: Theory and experimental evaluation
• Shortest-path algorithms: Taxonomy and annotation
• Shortest path methods: A unifying approach
• Properties of Labeling Methods for Determining Shortest Path Trees
• An Auction Algorithm for Shortest Paths
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
• Buckets, Heaps, Lists, and Monotone Priority Queues
• Reducibility among Combinatorial Problems
• Graph collapsing in shortest path auction algorithms

This page was built for publication: On Some Special Network Flow Problems: The Shortest Path Tour Problems