A shortest path routing problem with resource allocation
From MaRDI portal
Recommendations
- An algorithm for the resource constrained shortest path problem
- Some dynamic time-optimality problems on networks with allocation of several resource types
- An Appraisal of Some Shortest-Path Algorithms
- An approach to the shortest path problem with time-varying
- scientific article; zbMATH DE number 1114039
Cites work
- scientific article; zbMATH DE number 3805267 (Why is no real title available?)
- Introduction to the mathematical theory of control processes. Vol. II:Nonlinear processes
- The art and theory of dynamic programming
- The optimal route problem and the method of approximation in policy space
- Validity of Local Search in Multiparametric and Vector Linear Programming
Cited in
(10)- Algebraic theory on shortest paths for all flows
- An algorithm to determine a path with minimal cost/capacity ratio
- A New Necessary Condition for Shortest Path Routing
- Some dynamic time-optimality problems on networks with allocation of several resource types
- scientific article; zbMATH DE number 3968370 (Why is no real title available?)
- scientific article; zbMATH DE number 1670670 (Why is no real title available?)
- Maximum Reliability throught a Newtork with Resource Contraints
- An algorithm for the resource constrained shortest path problem
- Mathematical modeling for equipment updating based on shortest path
- Letter to the editor: A variant on the shortest-route problem
This page was built for publication: A shortest path routing problem with resource allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q581257)
