A note on the article "A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem"

作者：Montemanni R^*; Gambardella L M

来源：Omega-International Journal of Management Science, 2012, 40(6): 817-817.

DOI：10.1016/j.omega.2012.01.001

• Mixed integer linear programming
• Branch and cut
• Minimum-energy connectivity
• Wireless networks

In the paper Li et al. [A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem. Omega 2012;40:210-7] it is claimed that a theoretical result appeared in Montemanni and Gambardella [Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. Computers and Operations Research 2005;32:2891-904] is wrong. In this note we show that the original result is correct, and that the counter-example used to prove the wrongness of the original result is incorrect.

• 出版日期2012-12