{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T12:01:36Z","timestamp":1774440096069,"version":"3.50.1"},"reference-count":8,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,12,28]],"date-time":"2021-12-28T00:00:00Z","timestamp":1640649600000},"content-version":"vor","delay-in-days":361,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100009010","name":"Henan Agricultural University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009010","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2021MA012"],"award-info":[{"award-number":["ZR2021MA012"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>This study deals with the facility location problem of locating a set <jats:italic>V<\/jats:italic><jats:sub><jats:italic>p<\/jats:italic><\/jats:sub> of <jats:italic>p<\/jats:italic> facilities on a graph such that the subgraph induced by <jats:italic>V<\/jats:italic><jats:sub><jats:italic>p<\/jats:italic><\/jats:sub> is connected. We consider the connected <jats:italic>p<\/jats:italic>\u2010median problem on a cactus graph <jats:italic>G<\/jats:italic> whose vertices and edges have nonnegative weights. The aim of a connected <jats:italic>p<\/jats:italic>\u2010median problem is to minimize the sum of weighted distances from every vertex of a graph to the nearest vertex in <jats:italic>V<\/jats:italic><jats:sub><jats:italic>p<\/jats:italic><\/jats:sub>. We provide an <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic><jats:sup>2<\/jats:sup><jats:italic>p<\/jats:italic><jats:sup>2<\/jats:sup>) time algorithm for the connected <jats:italic>p<\/jats:italic>\u2010median problem, where <jats:italic>n<\/jats:italic> is the number of vertices.<\/jats:p>","DOI":"10.1155\/2021\/3533623","type":"journal-article","created":{"date-parts":[[2021,12,28]],"date-time":"2021-12-28T22:51:37Z","timestamp":1640731897000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Connected <i>P<\/i>\u2010Median Problem on Cactus Graphs"],"prefix":"10.1155","volume":"2021","author":[{"given":"Chunsong","family":"Bai","sequence":"first","affiliation":[]},{"given":"Jianjie","family":"Zhou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7019-4195","authenticated-orcid":false,"given":"Zuosong","family":"Liang","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,12,28]]},"reference":[{"key":"e_1_2_8_1_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"e_1_2_8_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.29.4.482"},{"key":"e_1_2_8_3_2","first-page":"1311","article-title":"The p-center problem with connectivity constraint","volume":"1","author":"Yen W. C.-K.","year":"2007","journal-title":"Applied Mathematical Sciences"},{"key":"e_1_2_8_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.12.013"},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.09.028"},{"key":"e_1_2_8_6_2","doi-asserted-by":"crossref","unstructured":"BaiC. S. KangL. Y. andShanE. F. The connectedp-center problem on cactus graphs Proceedings of the International Conference on Combinatorial Optimization and Applications December 2016 Hong Kong China 718\u2013725.","DOI":"10.1007\/978-3-319-48749-6_53"},{"key":"e_1_2_8_7_2","unstructured":"ShanE. F. ZhouJ. J. andKangL. Y. The connectedp-center andp-median problems on interval and circular-arc graphs Acta Mathematicae Applicatae Sinica."},{"key":"e_1_2_8_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0058-0"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/3533623.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/3533623.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/3533623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T11:02:47Z","timestamp":1722942167000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/3533623"}},"subtitle":[],"editor":[{"given":"Carmen","family":"De Maio","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/3533623"],"URL":"https:\/\/doi.org\/10.1155\/2021\/3533623","archive":["Portico"],"relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"value":"1687-5265","type":"print"},{"value":"1687-5273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-10-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-16","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"3533623"}}