{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:23:01Z","timestamp":1772119381695,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T00:00:00Z","timestamp":1700784000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T00:00:00Z","timestamp":1700784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61862034"],"award-info":[{"award-number":["61862034"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Natural Science Foundation of Jiangxi Province","award":["20202BABL202013"],"award-info":[{"award-number":["20202BABL202013"]}]},{"name":"Research on teaching Reform of colleges and universities in Jiangxi Province","award":["JXJG-21-2-53"],"award-info":[{"award-number":["JXJG-21-2-53"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s00500-023-09394-0","type":"journal-article","created":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T07:02:26Z","timestamp":1700809346000},"page":"5785-5793","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Community-based zigzag piloting algorithm for the strong generalized minimum label spanning tree problem"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6100-4975","authenticated-orcid":false,"given":"Hao","family":"Long","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinyan","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-xia","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhu-ming","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fu-ying","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,24]]},"reference":[{"issue":"2","key":"9394_CR1","first-page":"1","volume":"10","author":"C Cerrone","year":"2015","unstructured":"Cerrone C, Cerulli R, Gaudioso M (2015) OMEGA one multi ethnic genetic approach. Optimization Lett 10(2):1\u201316","journal-title":"Optimization Lett"},{"key":"9394_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cor.2017.03.016","volume":"85","author":"C Cerrone","year":"2017","unstructured":"Cerrone C, Cerulli R, Golden B (2017) Carousel greedy: A generalized greedy algorithm with applications in optimization. Comput Oper Res 85:97\u2013112","journal-title":"Comput Oper Res"},{"issue":"2","key":"9394_CR3","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1002\/net.21882","volume":"74","author":"C Cerrone","year":"2019","unstructured":"Cerrone C, D\u2019Ambrosio C, Raiconi A (2019) Heuristics for the strong generalized minimum label spanning tree problem. Networks 74(2):148","journal-title":"Networks"},{"key":"9394_CR4","doi-asserted-by":"crossref","unstructured":"Cerulli R , Fink A , Gentili M , et al (2005) Meta-heuristics comparison for the minimum labelling spanning tree problem. In: The Next Wave in Computing, Optimization, and Decision Technologies, pp 93\u2013106","DOI":"10.1007\/0-387-23529-9_7"},{"key":"9394_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","volume":"63","author":"RS Chang","year":"1997","unstructured":"Chang RS, Leu SJ (1997) The minimum labeling spanning trees. Inf Process Lett 63:277\u2013282","journal-title":"Inf Process Lett"},{"key":"9394_CR6","doi-asserted-by":"crossref","unstructured":"Chen Y, Cornick N, Hall AO, Shajpal R, Silberholz J, Yahav I, Golden BL (2008) Comparison of heuristicsforsolvingthegmlstproblem. In: Telecommunicationsmodeling, policy, and technology. Springer, Boston, pp 191\u2013217","DOI":"10.1007\/978-0-387-77780-1_9"},{"key":"9394_CR7","unstructured":"Chwatal AM, Raidl GR (2010) Solving the minimum label spanning tree problem by ant colony optimization. In: GEM. CSREA Press, pp 91\u201397"},{"key":"9394_CR8","first-page":"1","volume":"2011","author":"AM Chwatal","year":"2011","unstructured":"Chwatal AM, Raidl GR (2011) Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques. Adv Oper Res 2011:1\u201338","journal-title":"Adv Oper Res"},{"issue":"2","key":"9394_CR9","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.ejor.2008.03.014","volume":"196","author":"S Consoli","year":"2009","unstructured":"Consoli S, Darby-Dowman K, Mladenovi N et al (2009) Greedy randomized adaptive search and variable neighborhood search for the minimum labelling spanning tree problem. Eur J Oper Res 196(2):440\u2013449","journal-title":"Eur J Oper Res"},{"key":"9394_CR10","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.asoc.2014.12.020","volume":"28","author":"S Consoli","year":"2015","unstructured":"Consoli S, Mladenovic N, Moreno P\u00e9rez JA (2015) Solving the minimum labelling spanning tree problem by intelligent optimization. Appl Soft Comput 28:440\u2013452","journal-title":"Appl Soft Comput"},{"key":"9394_CR11","doi-asserted-by":"crossref","unstructured":"Granata D, Cerulli R,Scutell\u00e0 MG, Raiconi A, et al (2013) Maximum flow problems and an np-complete variant on edge-labeled graphs. In: Handbook of combinatorial optimization. Springer, New York, pp 1913\u20131948","DOI":"10.1007\/978-1-4419-7997-1_64"},{"key":"9394_CR12","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ins.2018.03.063","volume":"453","author":"L Hao","year":"2018","unstructured":"Hao L (2018) Overlapping community detection with least replicas in complex networks. Inform Sci 453:216\u2013226","journal-title":"Inform Sci"},{"issue":"(2,3)","key":"9394_CR15","first-page":"1950016","volume":"30","author":"L Hao","year":"2019","unstructured":"Hao L  (2019) Multi-resolution Community Detection in Weighted Complex Network. Int J Modern Phys 30(2,3):1950016","journal-title":"Int J Modern Phys"},{"issue":"11","key":"9394_CR16","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.physleta.2019.01.022","volume":"383","author":"L Hao","year":"2019","unstructured":"Hao L, Liu X-W (2019) Edge intensity-based community measurement in complex networks. Phys Lett A 383(11):1167\u20131173","journal-title":"Phys Lett A"},{"issue":"6","key":"9394_CR13","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1109\/TEVC.2013.2291790","volume":"18","author":"XS Lai","year":"2014","unstructured":"Lai XS, Zhou YR, He J, Zhang J (2014) Performance Analysis of Evolutionary Algorithms for the Minimum Label Spanning Tree Problem. IEEE Transact Evolutionary Computa 18(6):860\u2013872","journal-title":"IEEE Transact Evolutionary Computa"},{"issue":"1","key":"9394_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.32604\/cmes.2020.09502","volume":"125","author":"MG Lin","year":"2020","unstructured":"Lin MG, Liu FJ, Zhao HH, Chen JZ (2020) A Novel Binary Firefly Algorithm for the Minimum Labeling Spanning Tree Problem. CMES-Comput Modeling Eng Sci 125(1):197\u2013214","journal-title":"CMES-Comput Modeling Eng Sci"},{"issue":"1","key":"9394_CR17","doi-asserted-by":"publisher","first-page":"107112","DOI":"10.1016\/j.knosys.2021.107112","volume":"224","author":"V Moscato","year":"2021","unstructured":"Moscato V, Sperl\u00ec G (2021) A survey about community detection over On-line Social and Heterogeneous Information Networks. Knowledge-Based Syst 224(1):107112","journal-title":"Knowledge-Based Syst"},{"issue":"1","key":"9394_CR18","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s13675-018-0099-5","volume":"7","author":"T Silva","year":"2019","unstructured":"Silva T, Gueye S, Michelon P et al (2019a) A polyhedral approach to the generalized minimum labeling spanning tree problem. EURO J Computational Optimization 7(1):44\u201377","journal-title":"EURO J Computational Optimization"},{"issue":"1","key":"9394_CR19","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2018.09.044","volume":"274","author":"T Silva","year":"2019","unstructured":"Silva T, Queiroga E, Ochi LS et al (2019b) A hybrid meta-heuristic for the minimum labeling spanning tree problem. Eur J Oper Res 274(1):22\u201334","journal-title":"Eur J Oper Res"},{"key":"9394_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/net.22057","author":"R Vaisman","year":"2021","unstructured":"Vaisman R (2021) Finding minimum label spanning trees using cross-entropy method. Networks. https:\/\/doi.org\/10.1002\/net.22057","journal-title":"Networks"},{"issue":"9","key":"9394_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TEVC.2004.840145","volume":"2005","author":"Y Xiong","year":"2005","unstructured":"Xiong Y, Golden BL, Wasil EA (2005) A one-parameter genetic algorithm for the minimum labeling spanning tree problem. IEEE Trans Evolutionary Computation 2005(9):55\u201360","journal-title":"IEEE Trans Evolutionary Computation"},{"issue":"11","key":"9394_CR22","doi-asserted-by":"publisher","first-page":"1952","DOI":"10.1016\/j.cor.2009.12.013","volume":"37","author":"N-A Zahra","year":"2010","unstructured":"Zahra N-A et al (2010) Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems. Comput Operations Res 37(11):1952\u20131964","journal-title":"Comput Operations Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-09394-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-09394-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-09394-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T14:22:12Z","timestamp":1719411732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-09394-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,24]]},"references-count":22,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["9394"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-09394-0","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1715140\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,24]]},"assertion":[{"value":"16 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}