An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
From MaRDI portal
Publication:1664248
Recommendations
- Solving k-shortest and constrained shortest path problems efficiently
- Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths
- The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization
- On an exact method for the constrained shortest path problem
- An efficient exact approach for the constrained shortest path tour problem
- An algorithm for the resource constrained shortest path problem
- A simple efficient approximation scheme for the restricted shortest path problem
- Solving resource constrained shortest path problems with LP-based methods
- Approximation algorithms for somek-source shortest paths spanning tree problems
Cites work
- A bicriterion shortest path algorithm
- A note on two problems in connexion with graphs
- A simple efficient approximation scheme for the restricted shortest path problem
- A survey of resource constrained shortest path problems: exact solution approaches
- A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
- Approximation Schemes for the Restricted Shortest Path Problem
- Enumerating \(K\) best paths in length order in DAGs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Network flows. Theory, algorithms, and applications.
- On an exact method for the constrained shortest path problem
Cited in
(20)- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
- A dynamic programming algorithm for solving the k-color shortest path problem
- Solving a constrained economic lot size problem by ranking efficient production policies
- A novel approach to subgraph selection with multiple weights on arcs
- On an exact method for the constrained shortest path problem
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- Constraint-based local search for constrained optimum paths problems
- Algorithm for solving K-shortest paths problem in complicated network
- scientific article; zbMATH DE number 1543043 (Why is no real title available?)
- Acceleration strategies for the weight constrained shortest path problem with replenishment
- Computing constrained shortest-paths at scale
- Lazy constraint imposing for improving the path constraint
- Solving the constrained shortest path problem using random search strategy
- Algorithms and Computation
- Primal column generation framework for vehicle and crew scheduling problems
- An exact bidirectional pulse algorithm for the constrained shortest path
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- Enhanced methods for the weight constrained shortest path problem
- A fast and simple algorithm for the resource constrained shortest path problem
- Solving k-shortest and constrained shortest path problems efficiently
This page was built for publication: An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1664248)
