{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:50:28Z","timestamp":1757310628958,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,1,25]],"date-time":"2017-01-25T00:00:00Z","timestamp":1485302400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10732-017-9323-3","type":"journal-article","created":{"date-parts":[[2017,1,25]],"date-time":"2017-01-25T16:24:37Z","timestamp":1485361477000},"page":"31-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Network design through forests with degree- and role-constrained minimum spanning trees"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5556-1759","authenticated-orcid":false,"given":"Laura","family":"Anton-Sanchez","sequence":"first","affiliation":[]},{"given":"Concha","family":"Bielza","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"Larra\u00f1aga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,25]]},"reference":[{"key":"9323_CR1","first-page":"632","volume":"222","author":"JA Aledo","year":"2013","unstructured":"Aledo, J.A., G\u00e1mez, J.A., Molina, D.: Tackling the rank aggregation problem with evolutionary algorithms. Appl. Math. Comput. 222, 632\u2013644 (2013)","journal-title":"Appl. Math. Comput."},{"key":"9323_CR2","doi-asserted-by":"crossref","unstructured":"Anton-Sanchez, L., Bielza, C., Larra\u00f1aga, P.: Towards optimal neuronal wiring through estimation of distribution algorithms. In: Proceedings of the Fifteenth Annual Conference on Genetic and Evolutionary Computation, GECCO \u201913 Companion, pp. 1647\u20131650 (2013)","DOI":"10.1145\/2464576.2482744"},{"key":"9323_CR3","doi-asserted-by":"crossref","unstructured":"Bergmann, B., Hommel, G.: Improvements of general multiple test procedures for redundant systems of hypotheses. In: Multiple Hypotheses Testing, Medizinische Informatik und Statistik, vol.\u00a070, pp. 100\u2013115. Springer, Berlin (1988)","DOI":"10.1007\/978-3-642-52307-6_8"},{"issue":"1","key":"9323_CR4","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1016\/j.eswa.2009.05.088","volume":"37","author":"C Bielza","year":"2010","unstructured":"Bielza, C., Fern\u00e1ndez del Pozo, J.A., Larra\u00f1aga, P., Bengoetxea, E.: Multidimensional statistical analysis of the parameterization of a genetic algorithm for the optimal ordering of tables. Expert Syst. Appl. 37(1), 804\u2013815 (2010)","journal-title":"Expert Syst. Appl."},{"key":"9323_CR5","doi-asserted-by":"crossref","unstructured":"Ceberio, J., Mendiburu, A., Lozano, J.A.: Introducing the Mallows model on estimation of distribution algorithms. In: Neural Information Processing. Lecture Notes in Computer Science, vol. 7063, pp. 461\u2013470. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-24958-7_54"},{"issue":"1","key":"9323_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s13748-011-0005-3","volume":"1","author":"J Ceberio","year":"2012","unstructured":"Ceberio, J., Irurozki, E., Mendiburu, A., Lozano, J.A.: A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems. Prog. Artif. Intell. 1(1), 103\u2013117 (2012)","journal-title":"Prog. Artif. Intell."},{"issue":"2","key":"9323_CR7","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/TEVC.2013.2260548","volume":"18","author":"J Ceberio","year":"2014","unstructured":"Ceberio, J., Irurozki, E., Mendiburu, A., Lozano, J.A.: A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem. IEEE Trans. Evol. Comput. 18(2), 286\u2013300 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9323_CR8","doi-asserted-by":"crossref","unstructured":"Ceberio, J., Mendiburu, A., Lozano, J.A.: Kernels of mallows models for solving permutation-based problems. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2015, Madrid, July 11\u201315, 2015, pp. 505\u2013512 (2015)","DOI":"10.1145\/2739480.2754741"},{"key":"9323_CR9","doi-asserted-by":"crossref","unstructured":"Cobb, H., Grefenstette, J.: Genetic algorithms for tracking changing environments. In: Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 523\u2013530 (1993)","DOI":"10.21236\/ADA294075"},{"key":"9323_CR10","first-page":"23","volume":"4","author":"MM Czajko","year":"2009","unstructured":"Czajko, M.M., Wojciechowski, J.: Tree-based access network design under requirements for an aggregation network. Elektron. Konstr. Technol. Zastos. 4, 23\u201327 (2009)","journal-title":"Elektron. Konstr. Technol. Zastos."},{"key":"9323_CR11","doi-asserted-by":"crossref","unstructured":"Delbem, A., de Carvalho, A., Policastro, C., Pinto, A., Honda, K., Garc\u00eda, A.: Node-depth encoding for evolutionary algorithms applied to network design. In: Genetic and Evolutionary Computation. Lecture Notes in Computer Science, vol. 3102, pp. 678\u2013687. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-24854-5_70"},{"issue":"6","key":"9323_CR12","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1109\/TEVC.2011.2173579","volume":"16","author":"ACB Delbem","year":"2012","unstructured":"Delbem, A.C.B., de Lima, T.W., Telles, G.P.: Efficient forest data structure for evolutionary algorithms applied to network design. IEEE Trans. Evolut. Comput. 16(6), 829\u2013846 (2012)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"9323_CR13","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"9323_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut. Comput. 1(1), 3\u201318 (2011)","journal-title":"Swarm Evolut. Comput."},{"issue":"10","key":"9323_CR15","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1016\/j.advengsoft.2011.05.014","volume":"42","author":"JJ Durillo","year":"2011","unstructured":"Durillo, J.J., Nebro, A.J.: jMetal: a java framework for multi-objective optimization. Adv. Eng. Softw. 42(10), 760\u2013771 (2011)","journal-title":"Adv. Eng. Softw."},{"issue":"200","key":"9323_CR16","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman, M.: The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J. Am. Stat. Assoc. 32(200), 675\u2013701 (1937)","journal-title":"J. Am. Stat. Assoc."},{"key":"9323_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, New York (1979)"},{"key":"9323_CR18","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, Ann Arbor (1975)"},{"key":"9323_CR19","volume-title":"Sampling and Learning the Mallows and Generalized Mallows Models Under the Cayley Distance","author":"E Irurozki","year":"2014","unstructured":"Irurozki, E., Calvo, B., Lozano, J.A.: Sampling and Learning the Mallows and Generalized Mallows Models Under the Cayley Distance. University of the Basque Country, Spain (2014)"},{"key":"9323_CR20","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/4235.850653","volume":"4","author":"J Knowles","year":"2000","unstructured":"Knowles, J., Corne, D., Oates, M.: A new evolutionary approach to the degree constrained minimum spanning tree problem. IEEE Trans. Evol. Comput. 4, 125\u2013134 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"9323_CR21","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1023\/A:1011977126230","volume":"7","author":"M Krishnamoorthy","year":"2001","unstructured":"Krishnamoorthy, M., Ernst, A., Sharaiha, Y.: Comparison of algorithms for the degree constrained minimum spanning tree. J. Heuristics 7(6), 587\u2013611 (2001)","journal-title":"J. Heuristics"},{"issue":"1","key":"9323_CR22","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"9323_CR23","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larra\u00f1aga","year":"1999","unstructured":"Larra\u00f1aga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif. Intell. Rev. 13(2), 129\u2013170 (1999)","journal-title":"Artif. Intell. Rev."},{"volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","year":"2002","key":"9323_CR24","unstructured":"Larra\u00f1aga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston (2002)"},{"issue":"1\u20132","key":"9323_CR25","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1093\/biomet\/44.1-2.114","volume":"44","author":"CL Mallows","year":"1957","unstructured":"Mallows, C.L.: Non-null ranking models. Biometrika 44(1\u20132), 114\u2013130 (1957)","journal-title":"Biometrika"},{"key":"9323_CR26","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Technol. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Technol. J."},{"issue":"3","key":"9323_CR27","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"G Raidl","year":"2003","unstructured":"Raidl, G., Julstrom, B.: Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans. Evol. Comput. 7(3), 225\u2013239 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"9323_CR28","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves, C.R.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22(1), 5\u201313 (1995)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9323_CR29","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Oper. Res. 165(2), 479\u2013494 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9323_CR30","volume-title":"Algorithms","author":"R Sedgewick","year":"2011","unstructured":"Sedgewick, R., Wayne, K.: Algorithms, 4th edn. Addison-Wesley, Boston (2011)","edition":"4"},{"key":"9323_CR31","doi-asserted-by":"crossref","unstructured":"Soak, S.M., Corne, D., Ahn, B.H.: A new encoding for the degree constrained minimum spanning tree problem. In: Knowledge-Based Intelligent Information and Engineering Systems. Lecture Notes in Computer Science, vol. 3213, pp. 952\u2013958. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30132-5_128"},{"key":"9323_CR32","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/B978-0-08-050684-5.50009-4","volume":"1","author":"G Syswerda","year":"1991","unstructured":"Syswerda, G.: A study of reproduction in generational and steady-state genetic algorithms. Found. Genet. Algorithms 1, 94\u2013101 (1991)","journal-title":"Found. Genet. Algorithms"},{"key":"9323_CR33","doi-asserted-by":"crossref","unstructured":"Tsutsui, S.: Node histogram vs. edge histogram: a comparison of probabilistic model-building genetic algorithms in permutation domains. In: IEEE Congress on Evolutionary Computation, 2006, pp. 1939\u20131946 (2006)","DOI":"10.1109\/CEC.2006.1688544"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9323-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-017-9323-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9323-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T20:12:19Z","timestamp":1568751139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-017-9323-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,25]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9323"],"URL":"https:\/\/doi.org\/10.1007\/s10732-017-9323-3","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2017,1,25]]}}}