Complexity analysis and optimization of the shortest path tour problem
From MaRDI portal
Publication:691420
DOI10.1007/s11590-010-0258-yzbMath1259.90151OpenAlexW2058845836MaRDI QIDQ691420
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0258-y
Related Items (8)
The constrained shortest path tour problem ⋮ Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics ⋮ The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions ⋮ Route intelligent recommendation model and algorithm under the Pythagorean hesitant fuzzy linguistic environment ⋮ Shortest path tour problem with time windows ⋮ An efficient exact approach for the constrained shortest path tour problem ⋮ A generalized shortest path tour problem with time windows ⋮ Solving the shortest path tour problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope
- Negative-cycle detection algorithms
- 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
- A dual algorithm for the constrained shortest path problem
- Properties of Labeling Methods for Determining Shortest Path Trees
- An Auction Algorithm for Shortest Paths
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- The constrained shortest path problem
- Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
- Buckets, Heaps, Lists, and Monotone Priority Queues
This page was built for publication: Complexity analysis and optimization of the shortest path tour problem
