A note on the article “A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem”
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.
Volume (Year): 40 (2012)
Issue (Month): 6 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:40:y:2012:i:6:p:817-817. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.