A branch-and-cut approach for the minimum-energy broadcasting problem in wireless networks
Year of publication: |
2012
|
---|---|
Authors: | Li, Xiangyong ; Aneja, Yash P. |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 24.2012, 3, p. 443-456
|
Subject: | Operations Research | Operations research | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming | Computernetz | Computer network | USA | United States |
-
Branch-and-cut algorithms for the p-arborescence star problem
Pereira, Armando Honorio, (2022)
-
A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem
Li, Xiangyong, (2012)
-
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems
Akyüz, M. Hakan, (2013)
- More ...
-
Li, Xiangyong, (2011)
-
Li, Xiangyong, (2010)
-
Using branch-and-price approach to solve the directed network design problem with relays
Li, Xiangyong, (2012)
- More ...