Optimized Design of Dynamic Networks with Heuristic Algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4152177
- Heuristics for the network design problem with connectivity requirements
- Efficient implementation of heuristics for the continuous network design problem
- scientific article; zbMATH DE number 4027150
- Heuristic algorithms for the optimisation of telecommunication networks
- Optimization of dynamic routing networks
- A heuristic algorithm for network equilibration
- Algorithms for finding optimal flows in dynamic networks
- Publication:4728133
Cited in
(5)- Topology design for on-demand dual-path routing in wireless networks
- Dynamic design of a reliable computer network on using information theory
- Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
- Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem
This page was built for publication: Optimized Design of Dynamic Networks with Heuristic Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5427973)