Loading…

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!

cited_by
cites	cdi_FETCH-LOGICAL-c341t-3ca899864213a99b3272a0945d058a3004e1238b2f726600387620fa1717cdc93
container_end_page	817
container_issue	6
container_start_page	817
container_title	Omega (Oxford)
container_volume	40
creator	Montemanni, R. Gambardella, L.M.
description	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.
doi_str_mv	10.1016/j.omega.2012.01.001
format	article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_942455437</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305048312000023</els_id><sourcerecordid>2619121391</sourcerecordid><originalsourceid>FETCH-LOGICAL-c341t-3ca899864213a99b3272a0945d058a3004e1238b2f726600387620fa1717cdc93</originalsourceid><addsrcrecordid>eNp9kMtu1DAUhq0KpA6FJ-jGQmKZcHxJnCxYjCpuUiU2sLYc56Tj6cQebKdouuqDwMv1SfB0Kpaszua_nY-QSwY1A9a-39ZhxhtTc2C8BlYDsDOyYp0SVcOVfEFWIKCpQHbinLxKaQtF0YFYkfs19SEjDZ7mDVITs7M7pI8Pv9c0hmFJmQ7ReLupjB8ru2Rq9vsYjN3QKcQnz-y8m5e5Qo_x5kDTYZ4xR2epx_wrxFtqg_dos7tz-UCLedjh_Pjw5zV5OZldwjfP94L8-PTx-9WX6vrb569X6-vKCslyJazp-r5rJWfC9P0guOIGetmM0HRGAEhkXHQDnxRvWwDRqZbDZJhiyo62Fxfk7Sm3VP9cMGW9DUv0pVL3ksumkUIVkTiJbAwpRZz0PrrZxINmoI-M9VY_MdZHxhqYLgSL691ztEnW7KYjKZf-WXmjytj-OOHDSYflzzuHUSfr0FscXSxk9Bjcf3v-AhmblJE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>942455437</pqid></control><display><type>article</type><title>A note on the article “A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem”</title><source>ScienceDirect Freedom Collection</source><creator>Montemanni, R. ; Gambardella, L.M.</creator><creatorcontrib>Montemanni, R. ; Gambardella, L.M.</creatorcontrib><description>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.</description><identifier>ISSN: 0305-0483</identifier><identifier>EISSN: 1873-5274</identifier><identifier>DOI: 10.1016/j.omega.2012.01.001</identifier><identifier>CODEN: OMEGA6</identifier><language>eng</language><publisher>Kidlington: Elsevier Ltd</publisher><subject>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</subject><ispartof>Omega (Oxford), 2012-12, Vol.40 (6), p.817-817</ispartof><rights>2012 Elsevier Ltd</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Pergamon Press Inc. Dec 2012</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c341t-3ca899864213a99b3272a0945d058a3004e1238b2f726600387620fa1717cdc93</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=25727299$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Montemanni, R.</creatorcontrib><creatorcontrib>Gambardella, L.M.</creatorcontrib><title>A note on the article “A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem”</title><title>Omega (Oxford)</title><description>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.</description><subject>Applied sciences</subject><subject>Branch & bound algorithms</subject><subject>Branch and cut</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Connectivity</subject><subject>Exact sciences and technology</subject><subject>Mathematical programming</subject><subject>Minimum-energy connectivity</subject><subject>Mixed integer linear programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimization algorithms</subject><subject>Software</subject><subject>Studies</subject><subject>Wireless networks</subject><issn>0305-0483</issn><issn>1873-5274</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNp9kMtu1DAUhq0KpA6FJ-jGQmKZcHxJnCxYjCpuUiU2sLYc56Tj6cQebKdouuqDwMv1SfB0Kpaszua_nY-QSwY1A9a-39ZhxhtTc2C8BlYDsDOyYp0SVcOVfEFWIKCpQHbinLxKaQtF0YFYkfs19SEjDZ7mDVITs7M7pI8Pv9c0hmFJmQ7ReLupjB8ru2Rq9vsYjN3QKcQnz-y8m5e5Qo_x5kDTYZ4xR2epx_wrxFtqg_dos7tz-UCLedjh_Pjw5zV5OZldwjfP94L8-PTx-9WX6vrb569X6-vKCslyJazp-r5rJWfC9P0guOIGetmM0HRGAEhkXHQDnxRvWwDRqZbDZJhiyo62Fxfk7Sm3VP9cMGW9DUv0pVL3ksumkUIVkTiJbAwpRZz0PrrZxINmoI-M9VY_MdZHxhqYLgSL691ztEnW7KYjKZf-WXmjytj-OOHDSYflzzuHUSfr0FscXSxk9Bjcf3v-AhmblJE</recordid><startdate>20121201</startdate><enddate>20121201</enddate><creator>Montemanni, R.</creator><creator>Gambardella, L.M.</creator><general>Elsevier Ltd</general><general>Elsevier</general><general>Pergamon Press Inc</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>K9.</scope></search><sort><creationdate>20121201</creationdate><title>A note on the article “A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem”</title><author>Montemanni, R. ; Gambardella, L.M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c341t-3ca899864213a99b3272a0945d058a3004e1238b2f726600387620fa1717cdc93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Applied sciences</topic><topic>Branch & bound algorithms</topic><topic>Branch and cut</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Connectivity</topic><topic>Exact sciences and technology</topic><topic>Mathematical programming</topic><topic>Minimum-energy connectivity</topic><topic>Mixed integer linear programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimization algorithms</topic><topic>Software</topic><topic>Studies</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Montemanni, R.</creatorcontrib><creatorcontrib>Gambardella, L.M.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><jtitle>Omega (Oxford)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Montemanni, R.</au><au>Gambardella, L.M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A note on the article “A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem”</atitle><jtitle>Omega (Oxford)</jtitle><date>2012-12-01</date><risdate>2012</risdate><volume>40</volume><issue>6</issue><spage>817</spage><epage>817</epage><pages>817-817</pages><issn>0305-0483</issn><eissn>1873-5274</eissn><coden>OMEGA6</coden><abstract>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.</abstract><cop>Kidlington</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.omega.2012.01.001</doi><tpages>1</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 0305-0483
ispartof	Omega (Oxford), 2012-12, Vol.40 (6), p.817-817
issn	0305-0483 1873-5274
language	eng
recordid	cdi_proquest_journals_942455437
source	ScienceDirect Freedom Collection
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
title	A note on the article “A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem”
url	http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-19T06%3A53%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20note%20on%20the%20article%20%E2%80%9CA%20robust%20branch-and-cut%20approach%20for%20the%20minimum-energy%20symmetric%20network%20connectivity%20problem%E2%80%9D&rft.jtitle=Omega%20(Oxford)&rft.au=Montemanni,%20R.&rft.date=2012-12-01&rft.volume=40&rft.issue=6&rft.spage=817&rft.epage=817&rft.pages=817-817&rft.issn=0305-0483&rft.eissn=1873-5274&rft.coden=OMEGA6&rft_id=info:doi/10.1016/j.omega.2012.01.001&rft_dat=%3Cproquest_cross%3E2619121391%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c341t-3ca899864213a99b3272a0945d058a3004e1238b2f726600387620fa1717cdc93%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=942455437&rft_id=info:pmid/&rfr_iscdi=true