A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
From MaRDI portal
Publication:6082271
DOI10.1111/itor.13146OpenAlexW4224238992MaRDI QIDQ6082271
Unnamed Author, Bruno Nogueira, Andre L. L. Aquino, Rian Gabriel S. Pinheiro
Publication date: 29 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13146
Related Items (2)
Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach ⋮ Tighter bounds on the minimum broadcast time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum broadcast time problem for several processor networks
- Hybridizing exact methods and metaheuristics: a taxonomy
- Broadcasting in DMA-bound bounded degree graphs
- Biased random-key genetic algorithms with applications in telecommunications
- On the design of resilient heterogeneous wireless sensor networks based on small world concepts
- Efficient approaches for the flooding problem on graphs
- Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks
- Improved upper and lower bounds fork-broadcasting
- An algorithm for constructing minimalc-broadcast networks
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
- A Neighborhood Search Technique for the Freeze Tag Problem
- Broadcasting in Heterogeneous Tree Networks
- A survey of gossiping and broadcasting in communication networks
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Designing broadcasting algorithms in the postal model for message-passing systems
- A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
- Information dissemination in trees with nonuniform edge transmission times
- Random Graphs
This page was built for publication: A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
