A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks
Year of publication: |
2011
|
---|---|
Authors: | Montemanni, Roberto ; Leggieri, V. |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 74.2011, 3, p. 327-342
|
Subject: | Theorie | Theory | Operations Research | Operations research | Algorithmus | Algorithm | Packproblem | Packing problem | Computernetz | Computer network |
-
Grids for cutting and packing problems : a study in the 2D knapsack problem
Cunha, Jéssica Gabriela de Almeida, (2020)
-
Algorithms for the bin packing problem with conflicts
Muritiba, Albert Einstein Fernandes, (2010)
-
A hybrid algorithm for constrained order packing
Furian, Nikolaus, (2014)
- More ...
-
A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks
Montemanni, R., (2011)
-
A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks
Montemanni, R., (2011)
-
A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks
Montemanni, R., (2011)
- More ...