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 wirele...

Full description

Saved in:
Bibliographic Details
Published in:Omega (Oxford) 2012-12, Vol.40 (6), p.817-817
Main Authors: Montemanni, R., Gambardella, L.M.
Format: Article
Language:English
Subjects:
Applied sciences
Branch & bound algorithms
Branch and cut
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Connectivity
Exact sciences and technology
Mathematical programming
Minimum-energy connectivity
Mixed integer linear programming
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Software
Studies
Wireless networks
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0305-0483
1873-5274
DOI:10.1016/j.omega.2012.01.001