A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem
Year of publication: |
2012
|
---|---|
Authors: | Li, Xiangyong ; Aneja, Y. P. ; Huo, Jiazhen |
Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 0305-0483, ZDB-ID 124502-8. - Vol. 40.2012, 2, p. 210-217
|
Subject: | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming | Computernetz | Computer network | Energieeinsparung | Energy conservation | Operations Research | Operations research |
-
A branch-and-cut approach for the minimum-energy broadcasting problem in wireless networks
Li, Xiangyong, (2012)
-
Neto, Teresa, (2013)
-
A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof, (2022)
- More ...
-
Using branch-and-price approach to solve the directed network design problem with relays
Li, Xiangyong, (2012)
-
Montemanni, Roberto, (2012)
-
Li, Xiangyong, (2011)
- More ...