Algorithms for the Multi-constrained Routing Problem
From MaRDI portal
Publication:3046509
Recommendations
- The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization
- A quality of service multi-constraints routing algorithm based on dynamic programming
- Fast approximation algorithms for routing problems with hop-wise constraints
- Precomputation for multi-constrained QoS routing in GMPLS networks
- Optimal path algorithm with multi-constrained condition
Cited in
(9)- Optimal reachability for multi-priced timed automata
- Multi-weighted reachability games
- The subdivision-constrained routing requests problem
- On an iterative procedure for solving a routing problem with constraints
- The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization
- Optimal path algorithm with multi-constrained condition
- An algorithm for the solution of the two-route Johnson problem
- Constraint games for stable and optimal allocation of demands in SDN
- scientific article; zbMATH DE number 7455732 (Why is no real title available?)
This page was built for publication: Algorithms for the Multi-constrained Routing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046509)