{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T00:10:02Z","timestamp":1746144602357,"version":"3.40.4"},"publisher-location":"New Delhi","reference-count":24,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132217671"},{"type":"electronic","value":"9788132217688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-81-322-1768-8_53","type":"book-chapter","created":{"date-parts":[[2014,3,4]],"date-time":"2014-03-04T00:11:09Z","timestamp":1393891869000},"page":"601-612","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Strongly Biased Crossover Operator for Subgraph Selection in Edge-Set Based Graph Representation"],"prefix":"10.1007","author":[{"given":"Sakshi","family":"Arora","sequence":"first","affiliation":[]},{"given":"M. L.","family":"Garg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,4]]},"reference":[{"issue":"3","key":"53_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"GR Raidl","year":"2003","unstructured":"Raidl, G.R., Julstrom, B.A.: Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans. Evol. Comput. 7(3), 225\u2013239 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"53_CR2","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1006\/jagm.1997.0862","volume":"24.2","author":"S.P. Fekete","year":"1997","unstructured":"Fekete, S.P., et al.: A network-flow technique for finding low-weight bounded-degree spanning trees.\u00a0J. Algorithms\u00a024.2, 310\u2013324 (1997)","journal-title":"J. Algorithms"},{"key":"53_CR3","unstructured":"Julstrom, B.A., Raidl, G.R.: A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In: Workshop on Analysis and Design of Representations in 2003 Genetic and Evolutionary Computation Conference\u2019s Workshops Proceedings, pp. 2\u20137 (2003)"},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"Gen, M., Ida, K., Kim, J.: A spanning tree-based genetic algorithm for bicriteria topological network design. In: Evolutionary Computation Proceedings, 1998. The 1998 IEEE International Conference on IEEE World Congress on Computational Intelligence, pp. 15\u201320. IEEE (1998)","DOI":"10.1109\/ICEC.1998.699068"},{"issue":"3","key":"53_CR5","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1109\/TEVC.2008.2008799","volume":"13","author":"F Rothlauf","year":"2009","unstructured":"Rothlauf, F.: On the bias and performance of the edge-set encoding. IEEE Trans. Evol. Comput. 13(3), 486\u2013499 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"53_CR6","first-page":"202","volume-title":"Making the edge-set encoding fly by controlling the bias of its crossover operator","author":"F Rothlauf","year":"2005","unstructured":"Rothlauf, F., Tzschoppe, C.: Making the edge-set encoding fly by controlling the bias of its crossover operator, pp. 202\u2013212. Springer, Berlin (2005)"},{"key":"53_CR7","unstructured":"Tsutsui, S.: Sampling bias and search space boundary extension in real coded genetic algorithms. In\u00a0GECCO, pp. 211\u2013218 (2000)"},{"issue":"4","key":"53_CR8","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M Srinivas","year":"1994","unstructured":"Srinivas, M., Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. Syst. Man Cybernet. 24(4), 656\u2013667 (1994)","journal-title":"IEEE Trans. Syst. Man Cybernet."},{"key":"53_CR9","doi-asserted-by":"crossref","unstructured":"Julstrom, B.A.: Encoding rectilinear Steiner trees as lists of edges. In: Proceedings of the 2001 ACM Symposium on Applied Computing ACM, pp. 356\u2013360 (2001)","DOI":"10.1145\/372202.372365"},{"key":"53_CR10","doi-asserted-by":"crossref","unstructured":"Li, Y.: An effective implementation of a direct spanning tree representation in GAs. In: Applications of Evolutionary Computing, pp. 11\u201319. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45365-2_2"},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"Julstrom, B.A., Raidl, G.R.: Weight-biased edge-crossover in evolutionary algorithms for two graph problems. In: Proceedings of the 2001 ACM Symposium on Applied Computing, pp. 321\u2013326 (2001)","DOI":"10.1145\/372202.372353"},{"issue":"1","key":"53_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TSSC.1967.300102","volume":"3","author":"H Kaufman","year":"1967","unstructured":"Kaufman, H.: An experimental investigation of process identification by competitive evolution. IEEE Trans. Syst. Sci. Cybernet. 3(1), 11\u201316 (1967)","journal-title":"IEEE Trans. Syst. Sci. Cybernet."},{"key":"53_CR13","doi-asserted-by":"crossref","unstructured":"M\u00fchlenbein, H.: Parallel genetic algorithms, population genetics and combinatorial optimization. In: Parallelism, Learning, Evolution, pp. 398\u2013406. Springer, Berlin (1991)","DOI":"10.1007\/3-540-55027-5_23"},{"key":"53_CR14","first-page":"479","volume":"1503","author":"H Bersini","year":"1992","unstructured":"Bersini, H., Seront, G.: In search of a good crossover between evolution and optimization. Manner Manderick 1503, 479\u2013488 (1992)","journal-title":"Manner Manderick"},{"key":"53_CR15","doi-asserted-by":"crossref","unstructured":"Aizawa, A.N.: Evolving SSE: a stochastic schemata exploiter. In: Proceedings of the 1st IEEE Conference on Evolutionary Computation, pp. 525\u2013529. IEEE Press (1994)","DOI":"10.1109\/ICEC.1994.349895"},{"key":"53_CR16","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., Raue, P.E., Ruttkay, Z.: Genetic algorithms with multi-parent recombination. In: Parallel Problem Solving from Nature\u2014PPSN III, pp. 78\u201387. Springer, Berlin (1994)","DOI":"10.1007\/3-540-58484-6_252"},{"key":"53_CR17","doi-asserted-by":"crossref","unstructured":"Tsutsui, S.: Multi-parent recombination in genetic algorithms with search space boundary extension by mirroring. In: Parallel Problem Solving from Nature\u2014PPSN V. Springer, Berlin (1998)","DOI":"10.1007\/BFb0056885"},{"issue":"2","key":"53_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/4235.850653","volume":"4","author":"J Knowles","year":"2000","unstructured":"Knowles, J., Corne, D.: A new evolutionary approach to the degree-constrained minimum spanning tree problem. IEEE Trans. Evol. Comput. 4(2), 125\u2013134 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"53_CR19","doi-asserted-by":"crossref","unstructured":"Deo, N., Abdalla, A.: Computing a diameter-constrained minimum spanning tree in parallel. In: Algorithms and Complexity, pp. 17\u201331. Springer, Berlin (2000)","DOI":"10.1007\/3-540-46521-9_2"},{"key":"53_CR20","unstructured":"Arora, S., Garg, M.L.: New hybrid evolutionary algorithm for solving the bounded diameter minimum spanning tree problem (2009)"},{"key":"53_CR21","doi-asserted-by":"crossref","unstructured":"Arora, S., Garg, M.L.: Clustering the data points to obtain optimum backbones for the bounded diameter minimum spanning trees. In: 2011 International Conference on Communication Systems and Network Technologies (CSNT), pp. 303\u2013307. IEEE (2011)","DOI":"10.1109\/CSNT.2011.164"},{"key":"53_CR22","unstructured":"Arora, S., Garg, M.L.: Neighborhood search for the bounded diameter minimum spanning tree. Int. J. Emerg. Technol. Adv. Eng. 3(2) (2013)"},{"key":"53_CR23","unstructured":"Kopinitsch, B.: An ant colony optimisation algorithm for the bounded diameter minimum spanning tree problem. Vienna University of Technology, Institute of Computer Graphics and Algorithms (2006)"},{"key":"53_CR24","doi-asserted-by":"crossref","unstructured":"Gruber, M., Raidl, G.R.: Variable neighborhood search for the bounded diameter minimum spanning tree problem. PhD thesis, Institute of Computer Graphics and Algorithms, Vienna University of Technology, pp. 1187\u20131194 (2006)","DOI":"10.1145\/1143997.1144185"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Third International Conference on Soft Computing for Problem Solving"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-1768-8_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T23:52:19Z","timestamp":1746143539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-1768-8_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9788132217671","9788132217688"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-1768-8_53","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"4 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}