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 |
-
Branch-and-cut algorithms for the p-arborescence star problem
Pereira, Armando Honorio, (2022)
-
A branch-and-cut approach for the minimum-energy broadcasting problem in wireless networks
Li, Xiangyong, (2012)
-
Multivariable branching : a 0-1 knapsack problem case study
Yang, Yu, (2021)
- More ...
-
Montemanni, Roberto, (2012)
-
Using branch-and-price approach to solve the directed network design problem with relays
Li, Xiangyong, (2012)
-
The optimization model for the service process ofstomatology department via DES simulation
He, Qiaodan, (2020)
- More ...