CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL
From MaRDI portal
Publication:4337491
Recommendations
- scientific article; zbMATH DE number 3869088
- scientific article; zbMATH DE number 2087020
- Network reduction for the acyclic constrained shortest path problem
- Efficient distributed algorithms for topology control problem with shortest path constraints
- scientific article; zbMATH DE number 3554973
- Algorithms for solving discrete control problems on networks
- Constrained shortest link-disjoint paths selection: a network programming based approach
- Shortest-Path Routing in Arbitrary Networks
Cites work
- A note on two problems in connexion with graphs
- An efficient Dijkstra-like labeling method for computing shortest odd/even paths
- Iterative methods for determining the k shortest paths in a network
- Shortest path under rational constraint
- Some Recent Advances in Network Flows
- Temporal constraint networks
- The equity constrained shortest path problem
- The shortest route problem with constraints
Cited in
(6)- A heuristic algorithm for multi-constrained shortest link-disjoint paths
- Operator calculus algorithms for multi-constrained paths
- Algorithms – ESA 2005
- New Routing Strategies for RSP Problems with Concave Cost
- A New Necessary Condition for Shortest Path Routing
- Modeling for shortest path of road network with restriction
This page was built for publication: CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337491)
