Some constrained shortest-route problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3156822 (Why is no real title available?)
- scientific article; zbMATH DE number 3294150 (Why is no real title available?)
- A Decomposition Algorithm for the Shortest-Route Problem
- A Dynamic Programming Approach to Sequencing Problems
- An Appraisal of Some Shortest-Path Algorithms
- Dynamic Programming Treatment of the Travelling Salesman Problem
- On a routing problem
- Solutions of the Shortest-Route Problem—A Review
- The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph
- The Extension of the Cascade Algorithm to Large Graphs
- The Routing Problem with “K” Specified Nodes
- The Traveling Salesman Problem: A Survey
Cited in
(11)- Reachability in choice networks
- An efficient exact approach for the constrained shortest path tour problem
- Algorithms for shortest path tour problem in large-scale road network
- The ripple-spreading algorithm for shortest path tour problems
- A generalized shortest path tour problem with time windows
- Analyzing the reachability problem in choice networks
- The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
- Shortest path tour problem with time windows
- Some optimal path problems subject to improvements
- Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
- Algorithms for shortest path tour problem
This page was built for publication: Some constrained shortest-route problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5636707)
