{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T19:41:49Z","timestamp":1774899709455,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,4,3]],"date-time":"2010-04-03T00:00:00Z","timestamp":1270252800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10462-010-9158-x","type":"journal-article","created":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T23:00:59Z","timestamp":1270162859000},"page":"1-17","source":"Crossref","is-referenced-by-count":10,"title":["Leaf constrained minimal spanning trees solved by modified quantum-behaved particle swarm optimization"],"prefix":"10.1007","volume":"34","author":[{"given":"Saeed","family":"Farzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmad Baraani","family":"Dastjerdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,3]]},"reference":[{"key":"9158_CR1","first-page":"51","volume":"10","author":"NR Achuthan","year":"1994","unstructured":"Achuthan NR, Caccetta L, Caccetta PA, Geelan JF (1994) Computational methods for the diameter restricted minimum weight spanning tree problem. Australasian J Combinat 10: 51\u201371","journal-title":"Australasian J Combinat"},{"key":"9158_CR2","first-page":"153","volume":"15","author":"O Bor\u016fvka","year":"1926","unstructured":"Bor\u016fvka O (1926) Pr\u0306\u0131spe\u0306vek k r\u0306es\u0306en\u0131 ot\u00e1zky ekonomick\u00e9 stavby elektrovodn\u0131ch s\u0131t\u0131. Elektronick\u00fd obzor 15: 153\u2013154","journal-title":"Elektronick\u00fd obzor"},{"key":"9158_CR3","first-page":"61","volume":"141","author":"N Deo","year":"1999","unstructured":"Deo N, Micikevicius P (1999) A heuristic for the leaf-constrained minimum spanning tree problem. Congressus Numer 141: 61\u201372","journal-title":"Congressus Numer"},{"key":"9158_CR4","first-page":"17","volume-title":"Algorithms and complexity, LNCS vol. 1767","author":"N Deo","year":"2000","unstructured":"Deo N, Abdalla A (2000) Computing a diameter-constrained minimum spanning tree in parallel. In: Bongiovanni G, Gambosi G, Petreschi R (eds) Algorithms and complexity, LNCS vol. 1767. Springer, Berlin, pp 17\u201331"},{"key":"9158_CR5","first-page":"41","volume":"157","author":"W Edelson","year":"2002","unstructured":"Edelson W, Gargano ML (2002) Leaf-constrained minimal spanning trees solved by a genetic algorithm. Congres Numer 157: 41\u201348","journal-title":"Congres Numer"},{"key":"9158_CR6","volume-title":"Algorithmic combinatorics","author":"R Even","year":"1973","unstructured":"Even R (1973) Algorithmic combinatorics. Macmillan, New York"},{"key":"9158_CR7","doi-asserted-by":"crossref","unstructured":"Hoelting CJ, Schoenefeld DA, Wainwright RL (1995) Approximation techniques for variations of the p-median problem. In: Proceedings of the 1995 ACM Symposium on Applied Computing. ACM Press, pp. 293\u2013299","DOI":"10.1145\/315891.315997"},{"key":"9158_CR8","first-page":"385","volume":"14","author":"BA Julstrom","year":"2004","unstructured":"Julstrom BA (2004a) Codings and operators in two genetic algorithms for the leaf constrained minimum spanning tree problem. Int J Appl Math Comput Sci 14: 385\u2013396","journal-title":"Int J Appl Math Comput Sci"},{"key":"9158_CR9","first-page":"213","volume":"20","author":"BA Julstrom","year":"2004","unstructured":"Julstrom BA (2004) Better greedy heuristics for the leaf-constrained minimum spanning tree problem in complete graphs. Commun Discrete Appl Math 20: 213\u2013221","journal-title":"Commun Discrete Appl Math"},{"key":"9158_CR10","unstructured":"Julstrom BA, Raidl GR (2003) Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. Proc ACM Symp Applied Computing. ACM Press, New York, pp 747\u2013752"},{"key":"9158_CR11","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1995) Particle Swarm Optimization. Proceedings of IEEE 1995 International Conference on Neural Network, IV. Piscataway, 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"2","key":"9158_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/4235.850653","volume":"4","author":"J Knowles","year":"2000","unstructured":"Knowles J, Corne D (2000) A new evolutionary approach to the degree constrained minimum spanning tree problem. IEEE Trans Evolut Comput 4(2): 125\u2013134","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"9158_CR13","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Amer Math Soc 7(1): 48\u201350","journal-title":"Proc Amer Math Soc"},{"issue":"4","key":"9158_CR14","first-page":"39","volume":"7","author":"G Narula","year":"1989","unstructured":"Narula G, Ho CA (1989) Degree-constrained minimum spanning trees. Comput Oper Res 7(4): 39\u201349","journal-title":"Comput Oper Res"},{"issue":"1-3","key":"9158_CR15","first-page":"3","volume":"233","author":"J Ne\u0161et\u0159il","year":"2001","unstructured":"Ne\u0161et\u0159il J, Milkov\u00e1 E, Ne\u0161et\u0159ilov\u00e1 H (2001) Otakar Bor\u016fvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history. Discr Math 233(1-3): 3\u201336","journal-title":"Translation of both the 1926 papers, comments, history. Discr Math"},{"key":"9158_CR16","unstructured":"Picciotto S (1999) How to encode a tree. Ph.D. Thesis, University of California, San Diego"},{"key":"9158_CR17","first-page":"104","volume-title":"An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. Proc Congress Evolutionary Computation CEC00","author":"GR Raidl","year":"2000","unstructured":"Raidl GR (2000) An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. Proc Congress Evolutionary Computation CEC00. IEEE Press, Piscataway, NJ, pp 104\u2013111"},{"key":"9158_CR18","first-page":"327","volume":"31","author":"A Singh","year":"2008","unstructured":"Singh A (2008) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 31: 327\u2013334","journal-title":"Appl Soft Comput"},{"key":"9158_CR19","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1142\/S0217595908001870","volume":"25","author":"A Singh","year":"2008","unstructured":"Singh A, Baghel AS (2008) New metaheuristic approaches for the leaf-constrained minimum spanning tree problem. Asia-Pacific J Operat Res 25: 575\u2013589","journal-title":"Asia-Pacific J Operat Res"},{"key":"9158_CR20","doi-asserted-by":"crossref","unstructured":"Sun J et\u00a0al. (2004) Particle swarm optimization with particles having quantum behavior. Proc.of Congress on Evolutionary Computation pp. 325\u2013331","DOI":"10.1109\/CEC.2004.1330875"},{"key":"9158_CR21","unstructured":"Sun J et\u00a0al. (2004) A global search strategy of quantum-behaved particle swarm optimization. Proc. IEEE Conference on Cybernetics and Intelligent Systems, pp. 111\u2013116"},{"key":"9158_CR22","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/11539902_66","volume":"3612","author":"J Sun","year":"2005","unstructured":"Sun J, Xu W, Liu J (2005) Parameter selection of quantum-behaved particle swarm optimization. Proc Adv Nat Comput Lect Notes Comput Sci 3612: 543\u2013552","journal-title":"Proc Adv Nat Comput Lect Notes Comput Sci"},{"key":"9158_CR23","unstructured":"Van den Bergh F (2001) An analysis of particle swarm optimizers. Ph.D. Thesis. University of Pretoria"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-010-9158-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10462-010-9158-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-010-9158-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:45:08Z","timestamp":1559151908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10462-010-9158-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,3]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9158"],"URL":"https:\/\/doi.org\/10.1007\/s10462-010-9158-x","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,3]]}}}