Biased random-key genetic algorithms for the weighted minimum broadcast time problem
- 9 May 2025
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 349 (3) , 1749-1783
Abstract
No abstract availableKeywords
Funding Information
- Conselho Nacional de Desenvolvimento Científico e Tecnológico
- Conselho Nacional de Desenvolvimento Científico e Tecnológico
- Fundação de Amparo à Pesquisa do Estado de Alagoas
- Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro
This publication has 34 references indexed in Scilit:
- Optimal Broadcast Strategy in Homogeneous Point-to-Point Networks2020
- Efficient approaches for the Flooding Problem on graphsAnnals of Operations Research, 2018
- Time division inter‐satellite link topology generation problem: Modeling and solutionInternational Journal of Satellite Communications and Networking, 2017
- The broadcast median problem in heterogeneous postal modelJournal of Combinatorial Optimization, 2012
- Biased random-key genetic algorithms for combinatorial optimizationJournal of Heuristics, 2010
- Improved upper and lower bounds fork-broadcastingNetworks, 2001
- Designing broadcasting algorithms in the postal model for message-passing systemsTheory of Computing Systems, 1994
- Approximation algorithms for minimum time broadcast1992
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- A note on two problems in connexion with graphsNumerische Mathematik, 1959