Biased random-key genetic algorithms for the weighted minimum broadcast time problem
From MaRDI portal
Cites work
- A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation
- A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
- A Neighborhood Search Technique for the Freeze Tag Problem
- A note on two problems in connexion with graphs
- A survey of gossiping and broadcasting in communication networks
- Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks
- Biased random-key genetic algorithms with applications in telecommunications
- Broadcasting in DMA-bound bounded degree graphs
- Broadcasting in weighted trees under the postal model
- Designing broadcasting algorithms in the postal model for message-passing systems
- Efficient approaches for the flooding problem on graphs
- Efficient broadcast trees for weighted vertices
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2079323 (Why is no real title available?)
- Improved upper and lower bounds for k-broadcasting
- Information Dissemination in Trees
- Information dissemination in trees with nonuniform edge transmission times
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Random Graphs
- Strong bounds and exact solutions to the minimum broadcast time problem
- The broadcast median problem in heterogeneous postal model
- Tighter bounds on the minimum broadcast time
This page was built for publication: Biased random-key genetic algorithms for the weighted minimum broadcast time problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6960062)
