{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T17:21:14Z","timestamp":1732036874584},"reference-count":46,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1016\/j.ejor.2017.08.015","type":"journal-article","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T04:17:36Z","timestamp":1503029856000},"page":"478-487","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":40,"title":["A two-level solution approach for solving the generalized minimum spanning tree problem"],"prefix":"10.1016","volume":"265","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-0626-9284","authenticated-orcid":false,"given":"Petric\u0103 C.","family":"Pop","sequence":"first","affiliation":[]},{"given":"Oliviu","family":"Matei","sequence":"additional","affiliation":[]},{"given":"Cosmin","family":"Sabo","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6877-027X","authenticated-orcid":false,"given":"Adrian","family":"Petrovan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2017.08.015_bib0001","series-title":"Nonlinear programming","author":"Bertsekas","year":"1999"},{"key":"10.1016\/j.ejor.2017.08.015_bib0002","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/net.3230200302","article-title":"The probabilistic minimum spanning tree problem","volume":"20","author":"Bertsimas","year":"1990","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2017.08.015_bib0003","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.eswa.2015.12.014","article-title":"A multi-operator genetic algorithm for generalized minimum spanning tree problem","volume":"50","author":"Contreras-Bolton","year":"2016","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2017.08.015_sbref0004","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1155\/2016\/1682925","article-title":"Automatically produced algorithms for the generalized minimum spanning tree problem","volume":"2016","author":"Contreras-Bolton","year":"2016","journal-title":"Scientific Programming"},{"key":"10.1016\/j.ejor.2017.08.015_bib0005","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on the two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.1016\/j.ejor.2017.08.015_bib0006","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0377-2217(99)00006-5","article-title":"Generalized spanning trees","volume":"120","author":"Dror","year":"2000","journal-title":"European Journal of Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2017.08.015_bib0007","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10288-006-0012-6","article-title":"The geometric generalized minimum spanning tree problem with grid clustering","volume":"4","author":"Feremans","year":"2006","journal-title":"4OR"},{"issue":"2","key":"10.1016\/j.ejor.2017.08.015_bib0008","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0377-2217(00)00267-8","article-title":"On generalized minimum spanning trees","volume":"134","author":"Feremans","year":"2001","journal-title":"European Journal of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2017.08.015_bib0009","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.10009","article-title":"A comparative analysis of several formulations for the generalized minimum spanning tree problem","volume":"39","author":"Feremans","year":"2002","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.ejor.2017.08.015_bib0011","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/net.10105","article-title":"The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm","volume":"43","author":"Feremans","year":"2004","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.ejor.2017.08.015_bib0012","doi-asserted-by":"crossref","first-page":"3526","DOI":"10.1016\/j.eswa.2011.09.043","article-title":"A GRASP-based approach to the generalized minimum spanning tree problem","volume":"39","author":"Ferreira","year":"2012","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2017.08.015_bib0013","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1109\/49.1956","article-title":"Tree structured fiber optics MAN\u2019s","volume":"6","author":"Gerla","year":"1988","journal-title":"IEEE Journal on Selected Areas in Communication SAC."},{"key":"10.1016\/j.ejor.2017.08.015_bib0014","series-title":"Proceedings of the second international conference on genetic algorithms and their application","first-page":"59","article-title":"Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy","author":"Goldberg","year":"1987"},{"issue":"3","key":"10.1016\/j.ejor.2017.08.015_bib0015","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1287\/ijoc.1040.0077","article-title":"Heuristic search for the generalized minimum spanning tree problem","volume":"17","author":"Golden","year":"2005","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2017.08.015_bib0016","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10732-007-9027-1","article-title":"The prize-collecting generalized minimum spanning tree problem","volume":"14","author":"Golden","year":"2008","journal-title":"Journal of Heuristics"},{"issue":"4","key":"10.1016\/j.ejor.2017.08.015_bib0017","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1057\/palgrave.jors.2601821","article-title":"Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm","volume":"56","author":"Haouari","year":"2005","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2017.08.015_bib0018","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1016\/j.ejor.2004.07.072","article-title":"Upper and lower bounding strategies for the generalized minimum spanning tree problem","volume":"172","author":"Haouari","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2017.08.015_bib0019","series-title":"Adaptation in natural artificial systems","author":"Holland","year":"1975"},{"issue":"5","key":"10.1016\/j.ejor.2017.08.015_bib0020","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10732-007-9047-x","article-title":"Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem","volume":"14","author":"Hu","year":"2008","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.ejor.2017.08.015_bib0021","series-title":"Proceedings of the fourteenth annual conference on genetic and evolutionary computation","first-page":"393","article-title":"An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem","author":"Hu","year":"2012"},{"key":"10.1016\/j.ejor.2017.08.015_bib0022","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(81)90004-4","article-title":"Stochastic spanning tree problem","volume":"3","author":"Ishii","year":"1981","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2017.08.015_bib0023","series-title":"Proceedings of the American Mathematical Society","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956"},{"key":"10.1016\/j.ejor.2017.08.015_bib0024","series-title":"Annals of discrete mathematics","first-page":"185","article-title":"The Steiner tree problem in graphs, surveys in combinatorial optimization","volume":"vol.\u00a031","author":"Maculan","year":"1987"},{"key":"10.1016\/j.ejor.2017.08.015_bib0025","series-title":"Invitation to discrete mathematics","author":"Matousek","year":"2008"},{"key":"10.1016\/j.ejor.2017.08.015_bib0026","series-title":"An introduction to genetic algorithms","author":"Mitchell","year":"1998"},{"key":"10.1016\/j.ejor.2017.08.015_bib0027","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1002\/net.3230260407","article-title":"On the generalized minimum spanning tree problem","volume":"26","author":"Myung","year":"1995","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2017.08.015_bib0028","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0305-0548(80)90022-2","article-title":"Degree-constrained minimum spanning tree","volume":"7","author":"Narula","year":"1980","journal-title":"Computer and Operations Research"},{"key":"10.1016\/j.ejor.2017.08.015_bib0029","series-title":"Documenta Mathematica","doi-asserted-by":"crossref","first-page":"127","DOI":"10.4171\/dms\/6\/17","article-title":"The origins of minimal spanning tree algorithms Boruvka and Jarnik","author":"Nesetril","year":"2012"},{"key":"10.1016\/j.ejor.2017.08.015_bib0030","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.ejor.2007.08.021","article-title":"A tabu search heuristic for the generalized minimum spanning tree problem","volume":"191","author":"Oncan","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2017.08.015_bib0031","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1023\/A:1011552313821","article-title":"Exact schema theory for genetic programming and variable-length genetic algorithms with one-point crossover","volume":"2","author":"Poli","year":"2001","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"10.1016\/j.ejor.2017.08.015_bib0032","unstructured":"Pop, P. C. (2002). The generalized minimum spanning tree problem (Ph.d. thesis). The Netherlands: Twente University Press."},{"issue":"2","key":"10.1016\/j.ejor.2017.08.015_bib0033","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/B:JMMA.0000036579.83218.8d","article-title":"New models of the generalized minimum spanning tree problem","volume":"3","author":"Pop","year":"2004","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"1","key":"10.1016\/j.ejor.2017.08.015_bib0034","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10479-006-0153-1","article-title":"On the prize-collecting generalized minimum spanning tree problem","volume":"150","author":"Pop","year":"2007","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2017.08.015_bib0035","first-page":"104","article-title":"A survey of different integer programming formulations of the generalized minimum spanning tree problem","volume":"25","author":"Pop","year":"2009","journal-title":"Carpathian Journal of Mathematics"},{"key":"10.1016\/j.ejor.2017.08.015_bib0036","series-title":"Generalized network design problems, modelling and optimization","author":"Pop","year":"2012"},{"key":"10.1016\/j.ejor.2017.08.015_sbref0036","series-title":"Proceedings of the first ACiD conference","first-page":"115","article-title":"An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size","author":"Pop","year":"2005"},{"key":"10.1016\/j.ejor.2017.08.015_bib0038","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1016\/j.ejor.2004.07.058","article-title":"A new relaxation method for the generalized minimum spanning tree problem","volume":"170","author":"Pop","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2017.08.015_bib0039","first-page":"129","article-title":"The at least version of the generalized minimum spanning tree problem","volume":"22","author":"Pop","year":"2006","journal-title":"Carpathian Journal of Mathematics"},{"key":"10.1016\/j.ejor.2017.08.015_bib0040","series-title":"Advances in intelligent and soft computing","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-642-20505-7_16","article-title":"A memetic algorithm for solving the generalized minimum spanning tree problem","volume":"vol.\u00a096","author":"Pop","year":"2011"},{"key":"10.1016\/j.ejor.2017.08.015_bib0041","first-page":"42","article-title":"A simulated annealing based approach for solving the generalized minimum spanning tree problem","volume":"16","author":"Pop","year":"2007","journal-title":"Creative Mathematics and Informatics"},{"issue":"2","key":"10.1016\/j.ejor.2017.08.015_bib0042","first-page":"75","article-title":"A note on the complexity of the generalized minimum spanning tree problem","volume":"XLIX","author":"Pop","year":"2004","journal-title":"Studia Universitatis Babes-Bolyai, Series Informatics"},{"key":"10.1016\/j.ejor.2017.08.015_bib0043","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Systems Technical Journal"},{"key":"10.1016\/j.ejor.2017.08.015_bib0044","series-title":"IEEE Journal on Selected Areas in Communication SAC-4","first-page":"750","article-title":"Fiber optic regional area networks in New York and Dallas","author":"Prisco","year":"1986"},{"key":"10.1016\/j.ejor.2017.08.015_bib0045","unstructured":"Sollin, G. (1961). Probleme de l\u2019arbre minimum. (Unpublished manuscript prepared for the C. Berge\u2019s Paris seminar, February 8)."},{"key":"10.1016\/j.ejor.2017.08.015_bib0046","series-title":"Proceedings of the IEEE INFOCOM","first-page":"2007","article-title":"Power-aware speed scaling in processor sharing systems","author":"Wierman","year":"2009"},{"key":"10.1016\/j.ejor.2017.08.015_bib0047","series-title":"Quadratic minimum spanning tree problems and related topics","author":"Xu","year":"1984"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221717307464?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221717307464?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T10:17:25Z","timestamp":1719397045000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221717307464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["S0377221717307464"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2017.08.015","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2018,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A two-level solution approach for solving the generalized minimum spanning tree problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2017.08.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}