An addendum to the hierarchical network design problem
The hierarchical network design problem is the problem to find a spanning tree of minimum total weight, when the edges of the path between two given nodes are weighted by an other cost function than the tree edges not on this path. We point out that a dynamic programming oriented heuristic can alrea...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 1996-07, Vol.92 (1), p.214-216 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 216 |
|---|---|
| container_issue | 1 |
| container_start_page | 214 |
| container_title | European journal of operational research |
| container_volume | 92 |
| creator | Duin, C.W. Volgenant, A. |
| description | The hierarchical network design problem is the problem to find a spanning tree of minimum total weight, when the edges of the path between two given nodes are weighted by an other cost function than the tree edges not on this path. We point out that a dynamic programming oriented heuristic can already be found in literature. Further we report on possible extensions and improvements. |
| doi_str_mv | 10.1016/0377-2217(96)00016-1 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204139355</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0377221796000161</els_id><sourcerecordid>9840203</sourcerecordid><originalsourceid>FETCH-LOGICAL-c398t-5cc69946286235943353d831cb435d2a0bf3ea60625e57cc0e16b055baa3e5253</originalsourceid><addsrcrecordid>eNp9UMtOwzAQtBBIlMIfcIg4wSHgR-zEF6Sq4qlKXOBsOfaGuDQP7LSof4-joB6xNF7bmpn1DkKXBN8STMQdZnmeUkryayluMI5PKTlCM1LkNBWFwMdodqCcorMQ1iOJEz5DYtEm2lpo7bZJhi4ZakhqB157UzujN0kLw0_nvxILwX22Se-7cgPNOTqp9CbAxV-do4_Hh_flc7p6e3pZLlapYbIYUm6MkDITtBCUcZkxxpktGDFlxrilGpcVAy2woBx4bgwGIkrMeak1A045m6OryTf2_d5CGNS62_o2tlQUZ4RJxkdSNpGM70LwUKneu0b7vSJYjQGpcXo1Tq9kvIwBKRJlr5PMQw_moIG41p2HoHaKaUnjto8gMkqZduMxoo-gJFM0WtVDE83uJzOIaexigCoYB60B6zyYQdnO_f-bX4frg3o</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204139355</pqid></control><display><type>article</type><title>An addendum to the hierarchical network design problem</title><source>RePEc</source><source>Access via ScienceDirect (Elsevier)</source><creator>Duin, C.W. ; Volgenant, A.</creator><creatorcontrib>Duin, C.W. ; Volgenant, A.</creatorcontrib><description>The hierarchical network design problem is the problem to find a spanning tree of minimum total weight, when the edges of the path between two given nodes are weighted by an other cost function than the tree edges not on this path. We point out that a dynamic programming oriented heuristic can already be found in literature. Further we report on possible extensions and improvements.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/0377-2217(96)00016-1</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Elimination tests ; Heuristic ; Heuristics ; Hierarchical network design problem ; Mathematical models ; Network programming ; Operations research ; Studies</subject><ispartof>European journal of operational research, 1996-07, Vol.92 (1), p.214-216</ispartof><rights>1996</rights><rights>Copyright Elsevier Sequoia S.A. Jul 5, 1996</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c398t-5cc69946286235943353d831cb435d2a0bf3ea60625e57cc0e16b055baa3e5253</citedby><cites>FETCH-LOGICAL-c398t-5cc69946286235943353d831cb435d2a0bf3ea60625e57cc0e16b055baa3e5253</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/0377-2217(96)00016-1$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,4008,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a92_3ay_3a1996_3ai_3a1_3ap_3a214-216.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Duin, C.W.</creatorcontrib><creatorcontrib>Volgenant, A.</creatorcontrib><title>An addendum to the hierarchical network design problem</title><title>European journal of operational research</title><description>The hierarchical network design problem is the problem to find a spanning tree of minimum total weight, when the edges of the path between two given nodes are weighted by an other cost function than the tree edges not on this path. We point out that a dynamic programming oriented heuristic can already be found in literature. Further we report on possible extensions and improvements.</description><subject>Elimination tests</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Hierarchical network design problem</subject><subject>Mathematical models</subject><subject>Network programming</subject><subject>Operations research</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1996</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9UMtOwzAQtBBIlMIfcIg4wSHgR-zEF6Sq4qlKXOBsOfaGuDQP7LSof4-joB6xNF7bmpn1DkKXBN8STMQdZnmeUkryayluMI5PKTlCM1LkNBWFwMdodqCcorMQ1iOJEz5DYtEm2lpo7bZJhi4ZakhqB157UzujN0kLw0_nvxILwX22Se-7cgPNOTqp9CbAxV-do4_Hh_flc7p6e3pZLlapYbIYUm6MkDITtBCUcZkxxpktGDFlxrilGpcVAy2woBx4bgwGIkrMeak1A045m6OryTf2_d5CGNS62_o2tlQUZ4RJxkdSNpGM70LwUKneu0b7vSJYjQGpcXo1Tq9kvIwBKRJlr5PMQw_moIG41p2HoHaKaUnjto8gMkqZduMxoo-gJFM0WtVDE83uJzOIaexigCoYB60B6zyYQdnO_f-bX4frg3o</recordid><startdate>19960705</startdate><enddate>19960705</enddate><creator>Duin, C.W.</creator><creator>Volgenant, A.</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19960705</creationdate><title>An addendum to the hierarchical network design problem</title><author>Duin, C.W. ; Volgenant, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c398t-5cc69946286235943353d831cb435d2a0bf3ea60625e57cc0e16b055baa3e5253</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1996</creationdate><topic>Elimination tests</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Hierarchical network design problem</topic><topic>Mathematical models</topic><topic>Network programming</topic><topic>Operations research</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Duin, C.W.</creatorcontrib><creatorcontrib>Volgenant, A.</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Duin, C.W.</au><au>Volgenant, A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An addendum to the hierarchical network design problem</atitle><jtitle>European journal of operational research</jtitle><date>1996-07-05</date><risdate>1996</risdate><volume>92</volume><issue>1</issue><spage>214</spage><epage>216</epage><pages>214-216</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>The hierarchical network design problem is the problem to find a spanning tree of minimum total weight, when the edges of the path between two given nodes are weighted by an other cost function than the tree edges not on this path. We point out that a dynamic programming oriented heuristic can already be found in literature. Further we report on possible extensions and improvements.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/0377-2217(96)00016-1</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 1996-07, Vol.92 (1), p.214-216 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204139355 |
| source | RePEc; Access via ScienceDirect (Elsevier) |
| subjects | Elimination tests Heuristic Heuristics Hierarchical network design problem Mathematical models Network programming Operations research Studies |
| title | An addendum to the hierarchical network design problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T21%3A43%3A56IST&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=An%20addendum%20to%20the%20hierarchical%20network%20design%20problem&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Duin,%20C.W.&rft.date=1996-07-05&rft.volume=92&rft.issue=1&rft.spage=214&rft.epage=216&rft.pages=214-216&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/0377-2217(96)00016-1&rft_dat=%3Cproquest_cross%3E9840203%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204139355&rft_id=info:pmid/&rft_els_id=0377221796000161&rfr_iscdi=true |