Strong bounds and exact solutions to the minimum broadcast time problem
Year of publication: |
2025
|
---|---|
Authors: | Ivanova, Marika ; Haugland, Dag ; Tvedt, Bård Hennning |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 32.2025, 1, p. 314-352
|
Subject: | integer programming | bounds | broadcasting | computational experiments | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
-
Neto, Teresa, (2013)
- More ...
-
A fast local search method for minimum energy broadcast in wireless ad hoc networks
Bauer, Joanna, (2009)
-
An overview of models and solution methods for pooling problems
Haugland, Dag, (2010)
-
Borraz-Sánchez, Conrado, (2013)
- More ...