Clustered Shortest-Path Tree Problem Instances

+ The tested data for Clustered Shortest-Path Tree Problem. + The tested data were created based on the MOM of the Clustered Traveling Salesman Problem (https://www.sciencedirect.com/science/article/pii/S0305054812002122) + Get from: D:\OneDrive - moet.edu.vn\MyData\Read\Source code\10. MFO\W. Bench...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Thanh Pham Dinh
Format:	Dataset
Sprache:	eng
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page
container_issue
container_start_page
container_title
container_volume
creator	Thanh Pham Dinh
description	+ The tested data for Clustered Shortest-Path Tree Problem. + The tested data were created based on the MOM of the Clustered Traveling Salesman Problem (https://www.sciencedirect.com/science/article/pii/S0305054812002122) + Get from: D:\OneDrive - moet.edu.vn\MyData\Read\Source code\10. MFO\W. Benchmarks\04.Clustered_Tree_Instance_From_Clustered_TSP\Instances\Clustered_Tree_instances\MOM_Lib
doi_str_mv	10.17632/b4gcgybvt6
format	Dataset
fullrecord	<record><control><sourceid>datacite_PQ8</sourceid><recordid>TN_cdi_datacite_primary_10_17632_b4gcgybvt6</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_17632_b4gcgybvt6</sourcerecordid><originalsourceid>FETCH-datacite_primary_10_17632_b4gcgybvt63</originalsourceid><addsrcrecordid>eNpjYBA2NNAzNDczNtJPMklPTq9MKisx42TQc84pLS5JLUpNUQjOyC8qSS0u0Q1ILMlQCClKTVUIKMpPyknNVfDMKy5JzEtOLeZhYE1LzClO5YXS3Azabq4hzh66KYklicmZJanxBUWZuYlFlfGGBvFg2-IRthmTphoAjvs5Gw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>dataset</recordtype></control><display><type>dataset</type><title>Clustered Shortest-Path Tree Problem Instances</title><source>DataCite</source><creator>Thanh Pham Dinh</creator><creatorcontrib>Thanh Pham Dinh</creatorcontrib><description>+ The tested data for Clustered Shortest-Path Tree Problem. + The tested data were created based on the MOM of the Clustered Traveling Salesman Problem (https://www.sciencedirect.com/science/article/pii/S0305054812002122) + Get from: D:\OneDrive - moet.edu.vn\MyData\Read\Source code\10. MFO\W. Benchmarks\04.Clustered_Tree_Instance_From_Clustered_TSP\Instances\Clustered_Tree_instances\MOM_Lib</description><identifier>DOI: 10.17632/b4gcgybvt6</identifier><language>eng</language><publisher>Mendeley</publisher><creationdate>2022</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>782,1898</link.rule.ids><linktorsrc>$$Uhttps://commons.datacite.org/doi.org/10.17632/b4gcgybvt6$$EView_record_in_DataCite.org$$FView_record_in_$$GDataCite.org$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Thanh Pham Dinh</creatorcontrib><title>Clustered Shortest-Path Tree Problem Instances</title><description>+ The tested data for Clustered Shortest-Path Tree Problem. + The tested data were created based on the MOM of the Clustered Traveling Salesman Problem (https://www.sciencedirect.com/science/article/pii/S0305054812002122) + Get from: D:\OneDrive - moet.edu.vn\MyData\Read\Source code\10. MFO\W. Benchmarks\04.Clustered_Tree_Instance_From_Clustered_TSP\Instances\Clustered_Tree_instances\MOM_Lib</description><fulltext>true</fulltext><rsrctype>dataset</rsrctype><creationdate>2022</creationdate><recordtype>dataset</recordtype><sourceid>PQ8</sourceid><recordid>eNpjYBA2NNAzNDczNtJPMklPTq9MKisx42TQc84pLS5JLUpNUQjOyC8qSS0u0Q1ILMlQCClKTVUIKMpPyknNVfDMKy5JzEtOLeZhYE1LzClO5YXS3Azabq4hzh66KYklicmZJanxBUWZuYlFlfGGBvFg2-IRthmTphoAjvs5Gw</recordid><startdate>20220309</startdate><enddate>20220309</enddate><creator>Thanh Pham Dinh</creator><general>Mendeley</general><scope>DYCCY</scope><scope>PQ8</scope></search><sort><creationdate>20220309</creationdate><title>Clustered Shortest-Path Tree Problem Instances</title><author>Thanh Pham Dinh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-datacite_primary_10_17632_b4gcgybvt63</frbrgroupid><rsrctype>datasets</rsrctype><prefilter>datasets</prefilter><language>eng</language><creationdate>2022</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Thanh Pham Dinh</creatorcontrib><collection>DataCite (Open Access)</collection><collection>DataCite</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Thanh Pham Dinh</au><format>book</format><genre>unknown</genre><ristype>DATA</ristype><title>Clustered Shortest-Path Tree Problem Instances</title><date>2022-03-09</date><risdate>2022</risdate><abstract>+ The tested data for Clustered Shortest-Path Tree Problem. + The tested data were created based on the MOM of the Clustered Traveling Salesman Problem (https://www.sciencedirect.com/science/article/pii/S0305054812002122) + Get from: D:\OneDrive - moet.edu.vn\MyData\Read\Source code\10. MFO\W. Benchmarks\04.Clustered_Tree_Instance_From_Clustered_TSP\Instances\Clustered_Tree_instances\MOM_Lib</abstract><pub>Mendeley</pub><doi>10.17632/b4gcgybvt6</doi><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier	DOI: 10.17632/b4gcgybvt6
ispartof
issn
language	eng
recordid	cdi_datacite_primary_10_17632_b4gcgybvt6
source	DataCite
title	Clustered Shortest-Path Tree Problem Instances
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-01T05%3A45%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-datacite_PQ8&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=unknown&rft.au=Thanh%20Pham%20Dinh&rft.date=2022-03-09&rft_id=info:doi/10.17632/b4gcgybvt6&rft_dat=%3Cdatacite_PQ8%3E10_17632_b4gcgybvt6%3C/datacite_PQ8%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true