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.
A note on the article “A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem” / Montemanni, R; Gambardella, Lm. - In: OMEGA. - ISSN 0305-0483. - 40:6(2012), pp. 817-817.
Data di pubblicazione: | 2012 |
Titolo: | A note on the article “A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem” |
Autore/i: | Montemanni, R; Gambardella, Lm |
Autore/i UNIMORE: | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.omega.2012.01.001 |
Rivista: | |
Volume: | 40 |
Fascicolo: | 6 |
Pagina iniziale: | 817 |
Pagina finale: | 817 |
Codice identificativo ISI: | WOS:000302990300016 |
Codice identificativo Scopus: | 2-s2.0-84858752140 |
Citazione: | A note on the article “A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem” / Montemanni, R; Gambardella, Lm. - In: OMEGA. - ISSN 0305-0483. - 40:6(2012), pp. 817-817. |
Tipologia | Articolo su rivista |
File in questo prodotto:

I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris