{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:03:16Z","timestamp":1746158596495,"version":"3.40.4"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037554"},{"type":"electronic","value":"9783319037561"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03756-1_8","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T19:21:04Z","timestamp":1386876064000},"page":"85-94","source":"Crossref","is-referenced-by-count":0,"title":["An Ant Colony Optimization Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"V. Venkata Ramana","family":"Murthy","sequence":"first","affiliation":[]},{"given":"Alok","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Almeida, A.M., Martins, P., Souza, M.C.: Min-Degree Constrained Minimum Spanning Tree Problem: Complexity, Proprieties, and Formulations. Technical Report 6\/2006, Centre for Operational Research, University of Lisboa (2006)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.endm.2010.05.002","volume":"36","author":"A.M. Almeida","year":"2010","unstructured":"Almeida, A.M., Martins, P., Souza, M.C.: md-MST is $\\mathcal{NP}$ -Hard for d\u2009\u2265\u20093. Electronic Notes in Discrete Mathematics\u00a036, 9\u201315 (2010)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.cor.2009.03.006","volume":"37","author":"I. Akg\u00fcn","year":"2010","unstructured":"Akg\u00fcn, I., Tansel, B.C.: Min-Degree Constrained Minimum Spanning Tree Problem: New Formulation via Miller-Tucker-Zemlin Constraints. Computers & Operations Research\u00a037, 72\u201382 (2010)","journal-title":"Computers & Operations Research"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C. Miller","year":"1960","unstructured":"Miller, C., Tucker, A., Zemlin, R.: Integer Programming Formulation of Travelling Salesman Problems. Journal of ACM\u00a07, 326\u2013329 (1960)","journal-title":"Journal of ACM"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Murthy, V., V.R., Singh, A.: Solving the Min-Degree Constrained Minimum Spanning Tree Problem Using Heuristic and Metaheuristic Approaches. In: Proceedings of the Second IEEE International Conference on Parallel, Distributed and Grid Computing (PDGC 2012), pp. 716\u2013720. IEEE Press (2012)","DOI":"10.1109\/PDGC.2012.6449909"},{"key":"8_CR6","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Positive Feedback as a Search Strategy. Technical Report 91-016, Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy (1991)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man and Cybernetics \u2013 Part B\u00a026, 29\u201342 (1996)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics \u2013 Part B"},{"key":"8_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.ins.2012.01.037","volume":"195","author":"S. Sundar","year":"2012","unstructured":"Sundar, S., Singh, A., Rossi, A.: New Heuristics for Two Bounded-Degree Spanning Tree Problems. Information Sciences\u00a0195, 226\u2013240 (2012)","journal-title":"Information Sciences"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.asoc.2012.07.009","volume":"13","author":"A. Potluri","year":"2013","unstructured":"Potluri, A., Singh, A.: Hybrid Metaheuristic Algorithms for Minimum Weight Dominating Set. Applied Soft Computing\u00a013, 76\u201388 (2013)","journal-title":"Applied Soft Computing"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Sundar, S., Singh, A.: New Heuristic Approaches for the Dominating Tree Problem. Applied Soft Computing (in press, 2013), doi:10.1016\/j.asoc.2013.07.014","DOI":"10.1016\/j.asoc.2013.07.014"},{"key":"8_CR12","first-page":"385","volume":"14","author":"B.A. Julstrom","year":"2004","unstructured":"Julstrom, B.A.: Codings and Operators in Two Genetic Algorithms for the Leaf-Constrained Minimum Spanning Tree Problem. International Journal of Applied Mathematics and Computer Science\u00a014, 385\u2013396 (2004)","journal-title":"International Journal of Applied Mathematics and Computer Science"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1142\/S0217595908001870","volume":"25","author":"A. Singh","year":"2008","unstructured":"Singh, A., Baghel, A.S.: New Metaheuristic Approaches for the Leaf-Constrained Minimum Spanning Tree Problem. Asia-Pacific Journal of Operational Research\u00a025, 575\u2013589 (2008)","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A. Singh","year":"2009","unstructured":"Singh, A.: An Artificial Bee Colony Algorithm for the Leaf-Constrained Minimum Spanning Tree Problem. Applied Soft Computing\u00a09, 625\u2013631 (2009)","journal-title":"Applied Soft Computing"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10732-006-4295-8","volume":"12","author":"C. Solnon","year":"2006","unstructured":"Solnon, C., Fenet, S.: A Study of ACO Capabilities for Solving the Maximum Clique Problem. Journal of Heuristics\u00a012, 155\u2013180 (2006)","journal-title":"Journal of Heuristics"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/1068009.1068108","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference 2005 (GECCO 2005)","author":"B.A. Julstrom","year":"2005","unstructured":"Julstrom, B.A.: The Blob code is Competitive with Edge-Sets in Genetic Algorithms for the Minimum Routing Cost Spanning Tree Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference 2005 (GECCO 2005), vol.\u00a01, pp. 585\u2013590. ACM Press, New York (2005)"}],"container-title":["Lecture Notes in Computer Science","Swarm, Evolutionary, and Memetic Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03756-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:38:44Z","timestamp":1746074324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03756-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037554","9783319037561"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03756-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}