On Accuracy of Approximation for the Resource Constrained Shortest Path Problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1670670
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- An algorithm for the resource constrained shortest path problem
- A penalty function heuristic for the resource constrained shortest path problem
- A simple efficient approximation scheme for the restricted shortest path problem
Cites work
- A branch-and-cut algorithm for the capacitated profitable tour problem
- Approximation Schemes for the Restricted Shortest Path Problem
- scientific article; zbMATH DE number 1670670 (Why is no real title available?)
- 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
- Introduction to algorithms.
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Solving resource constrained shortest path problems with LP-based methods
- The shortest route problem with constraints
Cited in
(5)- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Shortest path with acceleration constraints: complexity and approximation algorithms
- Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
- RevTree
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
This page was built for publication: On Accuracy of Approximation for the Resource Constrained Shortest Path Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5853434)
