The Minimum Routing Cost Tree Problem
Abstract The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and pro...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Masone, Adriano [verfasserIn] Nenni, Maria Elena [verfasserIn] Sforza, Antonio [verfasserIn] Sterle, Claudio [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2018 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: Soft Computing - Springer-Verlag, 2003, 23(2018), 9 vom: 10. Okt., Seite 2947-2957 |
|---|---|
| Übergeordnetes Werk: |
volume:23 ; year:2018 ; number:9 ; day:10 ; month:10 ; pages:2947-2957 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00500-018-3557-3 |
|---|
| Katalog-ID: |
SPR006511783 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR006511783 | ||
| 003 | DE-627 | ||
| 005 | 20201124002925.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201005s2018 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00500-018-3557-3 |2 doi | |
| 035 | |a (DE-627)SPR006511783 | ||
| 035 | |a (SPR)s00500-018-3557-3-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Masone, Adriano |e verfasserin |4 aut | |
| 245 | 1 | 4 | |a The Minimum Routing Cost Tree Problem |
| 264 | 1 | |c 2018 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Abstract The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and proposes a new heuristic based on the identification of a core of the network around which the solution can be built. The algorithm has been tested on literature instances of up to one thousand nodes. The results, compared with those of other heuristic algorithms, prove the competitiveness of the proposed one both in terms of the quality of the solution and computation time. | ||
| 650 | 4 | |a Network design |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Spanning tree |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Routing cost |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Shortest path |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Nenni, Maria Elena |e verfasserin |4 aut | |
| 700 | 1 | |a Sforza, Antonio |e verfasserin |4 aut | |
| 700 | 1 | |a Sterle, Claudio |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Soft Computing |d Springer-Verlag, 2003 |g 23(2018), 9 vom: 10. Okt., Seite 2947-2957 |w (DE-627)SPR006469531 |7 nnns |
| 773 | 1 | 8 | |g volume:23 |g year:2018 |g number:9 |g day:10 |g month:10 |g pages:2947-2957 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s00500-018-3557-3 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 951 | |a AR | ||
| 952 | |d 23 |j 2018 |e 9 |b 10 |c 10 |h 2947-2957 | ||
| author_variant |
a m am m e n me men a s as c s cs |
|---|---|
| matchkey_str |
masoneadrianonennimariaelenasforzaantoni:2018----:hmnmmotncste |
| hierarchy_sort_str |
2018 |
| publishDate |
2018 |
| allfields |
10.1007/s00500-018-3557-3 doi (DE-627)SPR006511783 (SPR)s00500-018-3557-3-e DE-627 ger DE-627 rakwb eng Masone, Adriano verfasserin aut The Minimum Routing Cost Tree Problem 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and proposes a new heuristic based on the identification of a core of the network around which the solution can be built. The algorithm has been tested on literature instances of up to one thousand nodes. The results, compared with those of other heuristic algorithms, prove the competitiveness of the proposed one both in terms of the quality of the solution and computation time. Network design (dpeaa)DE-He213 Spanning tree (dpeaa)DE-He213 Routing cost (dpeaa)DE-He213 Shortest path (dpeaa)DE-He213 Nenni, Maria Elena verfasserin aut Sforza, Antonio verfasserin aut Sterle, Claudio verfasserin aut Enthalten in Soft Computing Springer-Verlag, 2003 23(2018), 9 vom: 10. Okt., Seite 2947-2957 (DE-627)SPR006469531 nnns volume:23 year:2018 number:9 day:10 month:10 pages:2947-2957 https://dx.doi.org/10.1007/s00500-018-3557-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 23 2018 9 10 10 2947-2957 |
| spelling |
10.1007/s00500-018-3557-3 doi (DE-627)SPR006511783 (SPR)s00500-018-3557-3-e DE-627 ger DE-627 rakwb eng Masone, Adriano verfasserin aut The Minimum Routing Cost Tree Problem 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and proposes a new heuristic based on the identification of a core of the network around which the solution can be built. The algorithm has been tested on literature instances of up to one thousand nodes. The results, compared with those of other heuristic algorithms, prove the competitiveness of the proposed one both in terms of the quality of the solution and computation time. Network design (dpeaa)DE-He213 Spanning tree (dpeaa)DE-He213 Routing cost (dpeaa)DE-He213 Shortest path (dpeaa)DE-He213 Nenni, Maria Elena verfasserin aut Sforza, Antonio verfasserin aut Sterle, Claudio verfasserin aut Enthalten in Soft Computing Springer-Verlag, 2003 23(2018), 9 vom: 10. Okt., Seite 2947-2957 (DE-627)SPR006469531 nnns volume:23 year:2018 number:9 day:10 month:10 pages:2947-2957 https://dx.doi.org/10.1007/s00500-018-3557-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 23 2018 9 10 10 2947-2957 |
| allfields_unstemmed |
10.1007/s00500-018-3557-3 doi (DE-627)SPR006511783 (SPR)s00500-018-3557-3-e DE-627 ger DE-627 rakwb eng Masone, Adriano verfasserin aut The Minimum Routing Cost Tree Problem 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and proposes a new heuristic based on the identification of a core of the network around which the solution can be built. The algorithm has been tested on literature instances of up to one thousand nodes. The results, compared with those of other heuristic algorithms, prove the competitiveness of the proposed one both in terms of the quality of the solution and computation time. Network design (dpeaa)DE-He213 Spanning tree (dpeaa)DE-He213 Routing cost (dpeaa)DE-He213 Shortest path (dpeaa)DE-He213 Nenni, Maria Elena verfasserin aut Sforza, Antonio verfasserin aut Sterle, Claudio verfasserin aut Enthalten in Soft Computing Springer-Verlag, 2003 23(2018), 9 vom: 10. Okt., Seite 2947-2957 (DE-627)SPR006469531 nnns volume:23 year:2018 number:9 day:10 month:10 pages:2947-2957 https://dx.doi.org/10.1007/s00500-018-3557-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 23 2018 9 10 10 2947-2957 |
| allfieldsGer |
10.1007/s00500-018-3557-3 doi (DE-627)SPR006511783 (SPR)s00500-018-3557-3-e DE-627 ger DE-627 rakwb eng Masone, Adriano verfasserin aut The Minimum Routing Cost Tree Problem 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and proposes a new heuristic based on the identification of a core of the network around which the solution can be built. The algorithm has been tested on literature instances of up to one thousand nodes. The results, compared with those of other heuristic algorithms, prove the competitiveness of the proposed one both in terms of the quality of the solution and computation time. Network design (dpeaa)DE-He213 Spanning tree (dpeaa)DE-He213 Routing cost (dpeaa)DE-He213 Shortest path (dpeaa)DE-He213 Nenni, Maria Elena verfasserin aut Sforza, Antonio verfasserin aut Sterle, Claudio verfasserin aut Enthalten in Soft Computing Springer-Verlag, 2003 23(2018), 9 vom: 10. Okt., Seite 2947-2957 (DE-627)SPR006469531 nnns volume:23 year:2018 number:9 day:10 month:10 pages:2947-2957 https://dx.doi.org/10.1007/s00500-018-3557-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 23 2018 9 10 10 2947-2957 |
| allfieldsSound |
10.1007/s00500-018-3557-3 doi (DE-627)SPR006511783 (SPR)s00500-018-3557-3-e DE-627 ger DE-627 rakwb eng Masone, Adriano verfasserin aut The Minimum Routing Cost Tree Problem 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and proposes a new heuristic based on the identification of a core of the network around which the solution can be built. The algorithm has been tested on literature instances of up to one thousand nodes. The results, compared with those of other heuristic algorithms, prove the competitiveness of the proposed one both in terms of the quality of the solution and computation time. Network design (dpeaa)DE-He213 Spanning tree (dpeaa)DE-He213 Routing cost (dpeaa)DE-He213 Shortest path (dpeaa)DE-He213 Nenni, Maria Elena verfasserin aut Sforza, Antonio verfasserin aut Sterle, Claudio verfasserin aut Enthalten in Soft Computing Springer-Verlag, 2003 23(2018), 9 vom: 10. Okt., Seite 2947-2957 (DE-627)SPR006469531 nnns volume:23 year:2018 number:9 day:10 month:10 pages:2947-2957 https://dx.doi.org/10.1007/s00500-018-3557-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 23 2018 9 10 10 2947-2957 |
| language |
English |
| source |
Enthalten in Soft Computing 23(2018), 9 vom: 10. Okt., Seite 2947-2957 volume:23 year:2018 number:9 day:10 month:10 pages:2947-2957 |
| sourceStr |
Enthalten in Soft Computing 23(2018), 9 vom: 10. Okt., Seite 2947-2957 volume:23 year:2018 number:9 day:10 month:10 pages:2947-2957 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Network design Spanning tree Routing cost Shortest path |
| isfreeaccess_bool |
false |
| container_title |
Soft Computing |
| authorswithroles_txt_mv |
Masone, Adriano @@aut@@ Nenni, Maria Elena @@aut@@ Sforza, Antonio @@aut@@ Sterle, Claudio @@aut@@ |
| publishDateDaySort_date |
2018-10-10T00:00:00Z |
| hierarchy_top_id |
SPR006469531 |
| id |
SPR006511783 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR006511783</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20201124002925.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201005s2018 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-018-3557-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR006511783</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s00500-018-3557-3-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Masone, Adriano</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The Minimum Routing Cost Tree Problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and proposes a new heuristic based on the identification of a core of the network around which the solution can be built. The algorithm has been tested on literature instances of up to one thousand nodes. The results, compared with those of other heuristic algorithms, prove the competitiveness of the proposed one both in terms of the quality of the solution and computation time.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network design</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Spanning tree</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Routing cost</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Shortest path</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nenni, Maria Elena</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sforza, Antonio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sterle, Claudio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft Computing</subfield><subfield code="d">Springer-Verlag, 2003</subfield><subfield code="g">23(2018), 9 vom: 10. Okt., Seite 2947-2957</subfield><subfield code="w">(DE-627)SPR006469531</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:23</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:9</subfield><subfield code="g">day:10</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:2947-2957</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s00500-018-3557-3</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">23</subfield><subfield code="j">2018</subfield><subfield code="e">9</subfield><subfield code="b">10</subfield><subfield code="c">10</subfield><subfield code="h">2947-2957</subfield></datafield></record></collection>
|
| author |
Masone, Adriano |
| spellingShingle |
Masone, Adriano misc Network design misc Spanning tree misc Routing cost misc Shortest path The Minimum Routing Cost Tree Problem |
| authorStr |
Masone, Adriano |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)SPR006469531 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
The Minimum Routing Cost Tree Problem Network design (dpeaa)DE-He213 Spanning tree (dpeaa)DE-He213 Routing cost (dpeaa)DE-He213 Shortest path (dpeaa)DE-He213 |
| topic |
misc Network design misc Spanning tree misc Routing cost misc Shortest path |
| topic_unstemmed |
misc Network design misc Spanning tree misc Routing cost misc Shortest path |
| topic_browse |
misc Network design misc Spanning tree misc Routing cost misc Shortest path |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
Soft Computing |
| hierarchy_parent_id |
SPR006469531 |
| hierarchy_top_title |
Soft Computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)SPR006469531 |
| title |
The Minimum Routing Cost Tree Problem |
| ctrlnum |
(DE-627)SPR006511783 (SPR)s00500-018-3557-3-e |
| title_full |
The Minimum Routing Cost Tree Problem |
| author_sort |
Masone, Adriano |
| journal |
Soft Computing |
| journalStr |
Soft Computing |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2018 |
| contenttype_str_mv |
txt |
| container_start_page |
2947 |
| author_browse |
Masone, Adriano Nenni, Maria Elena Sforza, Antonio Sterle, Claudio |
| container_volume |
23 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Masone, Adriano |
| doi_str_mv |
10.1007/s00500-018-3557-3 |
| author2-role |
verfasserin |
| title_sort |
minimum routing cost tree problem |
| title_auth |
The Minimum Routing Cost Tree Problem |
| abstract |
Abstract The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and proposes a new heuristic based on the identification of a core of the network around which the solution can be built. The algorithm has been tested on literature instances of up to one thousand nodes. The results, compared with those of other heuristic algorithms, prove the competitiveness of the proposed one both in terms of the quality of the solution and computation time. |
| abstractGer |
Abstract The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and proposes a new heuristic based on the identification of a core of the network around which the solution can be built. The algorithm has been tested on literature instances of up to one thousand nodes. The results, compared with those of other heuristic algorithms, prove the competitiveness of the proposed one both in terms of the quality of the solution and computation time. |
| abstract_unstemmed |
Abstract The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and proposes a new heuristic based on the identification of a core of the network around which the solution can be built. The algorithm has been tested on literature instances of up to one thousand nodes. The results, compared with those of other heuristic algorithms, prove the competitiveness of the proposed one both in terms of the quality of the solution and computation time. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER |
| container_issue |
9 |
| title_short |
The Minimum Routing Cost Tree Problem |
| url |
https://dx.doi.org/10.1007/s00500-018-3557-3 |
| remote_bool |
true |
| author2 |
Nenni, Maria Elena Sforza, Antonio Sterle, Claudio |
| author2Str |
Nenni, Maria Elena Sforza, Antonio Sterle, Claudio |
| ppnlink |
SPR006469531 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00500-018-3557-3 |
| up_date |
2024-07-03T23:20:21.070Z |
| _version_ |
1803601912603344896 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR006511783</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20201124002925.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201005s2018 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-018-3557-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR006511783</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s00500-018-3557-3-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Masone, Adriano</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The Minimum Routing Cost Tree Problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and proposes a new heuristic based on the identification of a core of the network around which the solution can be built. The algorithm has been tested on literature instances of up to one thousand nodes. The results, compared with those of other heuristic algorithms, prove the competitiveness of the proposed one both in terms of the quality of the solution and computation time.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network design</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Spanning tree</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Routing cost</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Shortest path</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nenni, Maria Elena</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sforza, Antonio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sterle, Claudio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft Computing</subfield><subfield code="d">Springer-Verlag, 2003</subfield><subfield code="g">23(2018), 9 vom: 10. Okt., Seite 2947-2957</subfield><subfield code="w">(DE-627)SPR006469531</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:23</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:9</subfield><subfield code="g">day:10</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:2947-2957</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s00500-018-3557-3</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">23</subfield><subfield code="j">2018</subfield><subfield code="e">9</subfield><subfield code="b">10</subfield><subfield code="c">10</subfield><subfield code="h">2947-2957</subfield></datafield></record></collection>
|
| score |
7.401247 |