Efficient Algorithms for Solving the Shortest Covering Path Problem
From MaRDI portal
Recommendations
- Algorithms and Computation
- Efficient Shortest Path Simplex Algorithms
- Faster algorithms for the shortest path problem
- scientific article; zbMATH DE number 176744
- Solving k-shortest and constrained shortest path problems efficiently
- Algorithms for shortest paths and d-cycle problems
- A computational study of efficient shortest path algorithms
- Algorithms for the quickest path problem and the enumeration of quickest paths
- A new algorithm for the shortest-path problem
Cited in
(13)- The maximum covering/shortest path problem: A multiobjective network design and routing formulation
- Models for multi-path covering problems
- A review of extensive facility location in networks
- The vehicle routing-allocation problem: A unifying framework
- The anchored network covering problem
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
- Dynamic programming approaches to solve the shortest path problem with forbidden paths
- A Lagrangian relaxation approach for expansion of a highway network
- Graph covering via shortest paths
- Solving the constrained shortest path problem using random search strategy
- Algorithms and Computation
- The transit route arc-node service maximization problem
- Solving a generalized traveling salesperson problem with stochastic customers
This page was built for publication: Efficient Algorithms for Solving the Shortest Covering Path Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834229)
