{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T12:07:47Z","timestamp":1792238867511,"version":"4.4.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T00:00:00Z","timestamp":1652313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T00:00:00Z","timestamp":1652313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005711","name":"Universit\u00e4t Hamburg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005711","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2022,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Fixed Set Search (FSS) is a novel metaheuristic that adds a learning mechanism to the Greedy Randomized Adaptive Search Procedure (GRASP). In recent publications, its efficiency has been shown on different types of combinatorial optimization problems like routing, machine scheduling and covering. In this paper the FSS is adapted to multi-objective problems for finding Pareto Front approximations. This adaptation is illustrated for the bi-objective Minimum Weighted Vertex Cover Problem (MWVCP). In this work, a simple and effective bi-objective GRASP algorithm for the MWVCP is developed in the first stage. One important characteristic of the proposed GRASP is that it avoids the use of weighted sums of objective functions in the local search and the greedy algorithm. In the second stage, the bi-objective GRASP is extended to the FSS by adding a learning mechanism adapted to multi-objective problems. The conducted computational experiments show that the proposed FSS and GRASP algorithm significantly outperforms existing methods for the bi-objective MWVCP. To fully evaluate the learning mechanism of the FSS, it is compared to the underlying GRASP algorithm on a wide range of performance indicators related to convergence, distribution, spread and cardinality.<\/jats:p>","DOI":"10.1007\/s10732-022-09499-z","type":"journal-article","created":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T14:12:55Z","timestamp":1652364775000},"page":"481-508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Fixed set search applied to the multi-objective minimum weighted vertex cover problem"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8167-1516","authenticated-orcid":false,"given":"Raka","family":"Jovanovic","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio P.","family":"Sanfilippo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,5,12]]},"reference":[{"issue":"2","key":"9499_CR1","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ejor.2020.11.016","volume":"292","author":"C Audet","year":"2021","unstructured":"Audet, C., Bigeon, J., Cartier, D., Le Digabel, S., Salomon, L.: Performance indicators in multiobjective optimization. Eur. J. Oper. Res. 292(2), 397\u2013422 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"9499_CR2","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10922-020-09521-4","volume":"28","author":"H Ben-Ammar","year":"2020","unstructured":"Ben-Ammar, H., Hadjadj-Aoul, Y.: A GRASP-based approach for dynamic cache resources placement in future networks. J. Netw. Syst. Manage. 28, 457\u2013477 (2020)","journal-title":"J. Netw. Syst. Manage."},{"issue":"6","key":"9499_CR3","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s10732-018-9381-1","volume":"24","author":"A Blot","year":"2018","unstructured":"Blot, A., Kessaci, M.\u00c9., Jourdan, L.: Survey and unification of local search techniques in metaheuristics for multi-objective combinatorial optimisation. J. Heurist. 24(6), 853\u2013877 (2018)","journal-title":"J. Heurist."},{"issue":"6","key":"9499_CR4","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.1016\/j.asoc.2012.02.013","volume":"12","author":"S Bouamama","year":"2012","unstructured":"Bouamama, S., Blum, C., Boukerram, A.: A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Appl. Soft Comput. 12(6), 1632\u20131639 (2012)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"9499_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9499_CR6","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1137\/10079731X","volume":"21","author":"AL Cust\u00f3dio","year":"2011","unstructured":"Cust\u00f3dio, A.L., Madeira, J.A., Vaz, A.I.F., Vicente, L.N.: Direct multisearch for multiobjective optimization. SIAM J. Optim. 21(3), 1109\u20131140 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9499_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"9","key":"9499_CR8","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1080\/01605682.2017.1404183","volume":"69","author":"JA D\u00edaz","year":"2018","unstructured":"D\u00edaz, J.A., Luna, D.E.: GRASP with path relinking for the manufacturing cell formation problem considering part processing sequence. J. Oper. Res. Soc. 69(9), 1493\u20131511 (2018)","journal-title":"J. Oper. Res. Soc."},{"key":"9499_CR9","doi-asserted-by":"publisher","unstructured":"Dur\u00e1n-Micco, J., Vansteenwegen, P.: A survey on the transit network design and frequency setting problem. Public Transp. (2021). https:\/\/doi.org\/10.1007\/s12469-021-00284-y","DOI":"10.1007\/s12469-021-00284-y"},{"issue":"2","key":"9499_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.: Greedy randomized adaptive search procedures. J. Global Optim. 6(2), 109\u2013133 (1995)","journal-title":"J. Global Optim."},{"key":"9499_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s12469-022-00292-6","author":"L Ge","year":"2022","unstructured":"Ge, L., Kliewer, N., Nourmohammadzadeh, A., Vo\u00df, S., Xie, L.: Revisiting the richness of integrated vehicle and crew scheduling. Public Transp. (2022). https:\/\/doi.org\/10.1007\/s12469-022-00292-6","journal-title":"Public Transp."},{"issue":"2","key":"9499_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12293-016-0216-z","volume":"10","author":"S Hu","year":"2018","unstructured":"Hu, S., Li, R., Zhao, P., Yin, M.: A hybrid metaheuristic algorithm for generalized vertex cover problem. Memet. Comput. 10(2), 165\u2013176 (2018)","journal-title":"Memet. Comput."},{"issue":"13","key":"9499_CR13","doi-asserted-by":"publisher","first-page":"3634","DOI":"10.3390\/su11133634","volume":"11","author":"S Hu","year":"2019","unstructured":"Hu, S., Wu, X., Liu, H., Wang, Y., Li, R., Yin, M.: Multi-objective neighborhood search algorithm based on decomposition for multi-objective minimum weighted vertex cover problem. Sustainability 11(13), 3634 (2019)","journal-title":"Sustainability"},{"key":"9499_CR14","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Imada, R., Setoguchi, Y., Nojima, Y.: Reference point specification in hypervolume calculation for fair comparison and efficient search. In: Proceedings of the genetic and evolutionary computation conference, Association for Computing Machinery, New York, NY, USA, GECCO \u201917, pp 585\u2013592, (2017)","DOI":"10.1145\/3071178.3071264"},{"issue":"8","key":"9499_CR15","doi-asserted-by":"publisher","first-page":"5360","DOI":"10.1016\/j.asoc.2011.05.023","volume":"11","author":"R Jovanovic","year":"2011","unstructured":"Jovanovic, R., Tuba, M.: An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl. Soft Comput. 11(8), 5360\u20135366 (2011)","journal-title":"Appl. Soft Comput."},{"key":"9499_CR16","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-030-34029-2_31","volume":"11544","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R., Vo\u00df, S.: Fixed set search applied to the minimum weighted vertex cover problem. Lect. Notes Comput. Sci. 11544, 490\u2013504 (2019)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"6","key":"9499_CR17","doi-asserted-by":"publisher","first-page":"e12559","DOI":"10.1111\/exsy.12559","volume":"37","author":"R Jovanovic","year":"2020","unstructured":"Jovanovic, R., Voss, S.: The fixed set search applied to the power dominating set problem. Expert. Syst. 37(6), e12559 (2020)","journal-title":"Expert. Syst."},{"key":"9499_CR18","doi-asserted-by":"publisher","first-page":"107521","DOI":"10.1016\/j.asoc.2021.107521","volume":"110","author":"R Jovanovic","year":"2021","unstructured":"Jovanovic, R., Vo\u00df, S.: Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times. Appl. Soft Comput. 110, 107521 (2021)","journal-title":"Appl. Soft Comput."},{"key":"9499_CR19","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-05983-5_5","volume":"11299","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R., Tuba, M., Vo\u00df, S.: Fixed set search applied to the traveling salesman problem. Lect. Notes Comput. Sci. 11299, 63\u201377 (2019)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9499_CR20","doi-asserted-by":"crossref","unstructured":"Karp, RM.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, Springer, pp 85\u2013103, (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9499_CR21","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.ins.2016.08.053","volume":"372","author":"R Li","year":"2016","unstructured":"Li, R., Hu, S., Zhang, H., Yin, M.: An efficient local search framework for the minimum weighted vertex cover problem. Inf. Sci. 372, 428\u2013445 (2016)","journal-title":"Inf. Sci."},{"key":"9499_CR22","doi-asserted-by":"publisher","first-page":"106382","DOI":"10.1016\/j.asoc.2020.106382","volume":"93","author":"Q Liu","year":"2020","unstructured":"Liu, Q., Li, X., Liu, H., Guo, Z.: Multi-objective metaheuristics for discrete optimization problems: A review of the state-of-the-art. Appl. Soft Comput. 93, 106382 (2020)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"9499_CR23","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1111\/itor.12452","volume":"25","author":"A L\u00f3pez-S\u00e1nchez","year":"2018","unstructured":"L\u00f3pez-S\u00e1nchez, A., Hern\u00e1ndez-D\u00edaz, A.G., Gort\u00e1zar, F., Hinojosa, M.A.: A multiobjective GRASP-VND algorithm to solve the waste collection problem. Int. Trans. Oper. Res. 25(2), 545\u2013567 (2018)","journal-title":"Int. Trans. Oper. Res."},{"key":"9499_CR24","doi-asserted-by":"publisher","unstructured":"Marinescu, R.: Best-first vs. depth-first and\/or search for multi-objective constraint optimization. In: 22nd IEEE international conference on tools with artificial intelligence, vol\u00a01, pp 439\u2013446, (2010). https:\/\/doi.org\/10.1109\/ICTAI.2010.69","DOI":"10.1109\/ICTAI.2010.69"},{"issue":"6","key":"9499_CR25","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00158-009-0460-7","volume":"41","author":"RT Marler","year":"2010","unstructured":"Marler, R.T., Arora, J.S.: The weighted sum method for multi-objective optimization: new insights. Struct. Multidiscip. Optim. 41(6), 853\u2013862 (2010)","journal-title":"Struct. Multidiscip. Optim."},{"issue":"1","key":"9499_CR26","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ejor.2014.06.042","volume":"240","author":"R Mart\u00ed","year":"2015","unstructured":"Mart\u00ed, R., Campos, V., Resende, M.G., Duarte, A.: Multiobjective GRASP with path relinking. Eur. J. Oper. Res. 240(1), 54\u201371 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9499_CR27","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1111\/itor.12725","volume":"27","author":"RG Marzo","year":"2020","unstructured":"Marzo, R.G., Ribeiro, C.C.: A GRASP with path-relinking and restarts heuristic for the prize-collecting generalized minimum spanning tree problem. Int. Trans. Oper. Res. 27(3), 1419\u20131446 (2020)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"9499_CR28","first-page":"455","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas, G.: Effective implementation of the $$\\varepsilon $$-constraint method in multi-objective mathematical programming problems. Appl. Math. Comput. 213(2), 455\u2013465 (2009)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"9499_CR29","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.disopt.2008.12.001","volume":"6","author":"W Pullan","year":"2009","unstructured":"Pullan, W.: Optimisation of unweighted\/weighted maximum independent sets and minimum vertex covers. Discret. Optim. 6(2), 214\u2013219 (2009)","journal-title":"Discret. Optim."},{"issue":"3","key":"9499_CR30","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/net.3230160305","volume":"16","author":"VJ Rayward-Smith","year":"1986","unstructured":"Rayward-Smith, V.J., Clare, A.: On finding Steiner vertices. Networks 16(3), 283\u2013294 (1986)","journal-title":"Networks"},{"key":"9499_CR31","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/0-387-25383-1_2","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"MG Resende","year":"2005","unstructured":"Resende, M.G., Ribeiro, C.C.: GRASP with path-relinking: recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 29\u201363. Springer, Boston, MA (2005)"},{"issue":"3","key":"9499_CR32","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00500-008-0320-1","volume":"13","author":"AP Reynolds","year":"2009","unstructured":"Reynolds, A.P., De la Iglesia, B.: A multi-objective GRASP for partial classification. Soft Comput. 13(3), 227\u2013243 (2009)","journal-title":"Soft Comput."},{"issue":"4","key":"9499_CR33","first-page":"455","volume":"29","author":"H Rezki","year":"2018","unstructured":"Rezki, H., Aghezzaf, B.: $$\\lambda $$-GRASP with bi-directional path relinking for the bi-objective orienteering problem. Int. J. Logist. Syst. Manag. 29(4), 455\u2013475 (2018)","journal-title":"Int. J. Logist. Syst. Manag."},{"key":"9499_CR34","unstructured":"Rollon, E., Larrosa, J.: Constraint optimization techniques for exact multi-objective optimization. In: Multiobjective Programming and Goal Programming, Lecture Notes in Economics and Mathematical Systems, vol 618, Springer, pp 89\u201398, (2009)"},{"issue":"8","key":"9499_CR35","doi-asserted-by":"publisher","first-page":"853","DOI":"10.3390\/math9080853","volume":"9","author":"J S\u00e1nchez-Oro","year":"2021","unstructured":"S\u00e1nchez-Oro, J., L\u00f3pez-S\u00e1nchez, A.D., Mart\u00ednez-Gavara, A., Hern\u00e1ndez-D\u00edaz, A.G., Duarte, A.: A hybrid strategic oscillation with path relinking algorithm for the multiobjective k-balanced center location problem. Mathematics 9(8), 853 (2021)","journal-title":"Mathematics"},{"issue":"1\u20134","key":"9499_CR36","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/B:ANOR.0000039523.95673.33","volume":"131","author":"SJ Shyu","year":"2004","unstructured":"Shyu, S.J., Yin, P.Y., Lin, B.M.: An ant colony optimization algorithm for the minimum weight vertex cover problem. Ann. Oper. Res. 131(1\u20134), 283\u2013304 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9499_CR37","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1142\/S0217595906000905","volume":"23","author":"A Singh","year":"2006","unstructured":"Singh, A., Gupta, A.K.: A hybrid heuristic for the minimum weight vertex cover problem. Asia-Pacific J. Oper. Res. 23(2), 273\u2013285 (2006)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"9499_CR38","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-1-4615-5775-3_21","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"L Sondergeld","year":"1999","unstructured":"Sondergeld, L., Vo\u00df, S.: Cooperative intelligent search using adaptive memory techniques. In: Vo\u00df, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 297\u2013312. Kluwer, Boston (1999)"},{"key":"9499_CR39","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and Surveys in Metaheuristics","author":"E Taillard","year":"2002","unstructured":"Taillard, E., Vo\u00df, S.: POPMUSIC - a partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 613\u2013629. Kluwer, Boston (2002)"},{"issue":"1","key":"9499_CR40","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02032309","volume":"58","author":"M Tamiz","year":"1995","unstructured":"Tamiz, M., Jones, D.F., El-Darzi, E.: A review of goal programming and its applications. Ann. Oper. Res. 58(1), 39\u201353 (1995)","journal-title":"Ann. Oper. Res."},{"key":"9499_CR41","unstructured":"Vianna, DS., Arroyo, JEC.: A GRASP algorithm for the multi-objective knapsack problem. In: XXIV international conference of the Chilean computer science society, IEEE, pp 69\u201375, (2004)"},{"issue":"6","key":"9499_CR42","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1007\/s10732-012-9211-9","volume":"18","author":"S Vo\u00df","year":"2012","unstructured":"Vo\u00df, S., Fink, A.: A hybridized tabu search approach for the minimum weight vertex cover problem. J. Heurist. 18(6), 869\u2013876 (2012)","journal-title":"J. Heurist."},{"key":"9499_CR43","first-page":"335","volume-title":"Network Design: Connectivity and Facilities Location, DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"S Vo\u00df","year":"1998","unstructured":"Vo\u00df, S., Gutenschwager, K.: A chunking based genetic algorithm for the Steiner tree problem in graphs. In: Pardalos, P., Du, D.Z. (eds.) Network Design: Connectivity and Facilities Location, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 40, pp. 335\u2013355. Princeton, AMS (1998)"},{"key":"9499_CR44","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10479-005-2060-2","volume":"136","author":"S Vo\u00df","year":"2005","unstructured":"Vo\u00df, S., Fink, A., Duin, C.: Looking ahead with the pilot method. Ann. Oper. Res. 136, 285\u2013302 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9499_CR45","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1080\/00207543.2020.1847342","volume":"60","author":"X Wan","year":"2022","unstructured":"Wan, X., Zuo, X., Li, X., Zhao, X.: A hybrid multiobjective GRASP for a multi-row facility layout problem with extra clearances. Int. J. Prod. Res. 60, 957\u2013976 (2022)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"9499_CR46","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/s10878-015-9937-z","volume":"33","author":"L Wang","year":"2017","unstructured":"Wang, L., Du, W., Zhang, Z., Zhang, X.: A PTAS for minimum weighted connected vertex cover $${P}_3$$ problem in 3-dimensional wireless sensor networks. J. Comb. Optim. 33(1), 106\u2013122 (2017)","journal-title":"J. Comb. Optim."},{"key":"9499_CR47","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0377-2217(97)00293-2","volume":"106","author":"D Woodruff","year":"1998","unstructured":"Woodruff, D.: Proposals for chunking and tabu search. Eur. J. Oper. Res. 106, 585\u2013598 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9499_CR48","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10732-017-9348-7","volume":"23","author":"L Xie","year":"2017","unstructured":"Xie, L., Merschformann, M., Kliewer, N., Suhl, L.: Metaheuristics approach for solving personalized crew rostering problem in public bus transit. J. Heurist. 23(5), 321\u2013347 (2017). https:\/\/doi.org\/10.1007\/s10732-017-9348-7","journal-title":"J. Heurist."},{"issue":"2","key":"9499_CR49","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s10878-015-9909-3","volume":"32","author":"T Zhou","year":"2016","unstructured":"Zhou, T., L\u00fc, Z., Wang, Y., Ding, J., Peng, B.: Multi-start iterated tabu search for the minimum weight vertex cover problem. J. Comb. Optim. 32(2), 368\u2013384 (2016)","journal-title":"J. Comb. Optim."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-022-09499-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-022-09499-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-022-09499-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T04:23:39Z","timestamp":1661487819000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-022-09499-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,12]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["9499"],"URL":"https:\/\/doi.org\/10.1007\/s10732-022-09499-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,12]]},"assertion":[{"value":"21 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}