{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T19:15:52Z","timestamp":1723230952914},"reference-count":70,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61370156","61403076","61403077"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004602","name":"Program for New Century Excellent Talents in University","doi-asserted-by":"publisher","award":["NCET-13-0724"],"id":[{"id":"10.13039\/501100004602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1016\/j.ins.2016.08.053","type":"journal-article","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T08:03:09Z","timestamp":1471852989000},"page":"428-445","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":34,"special_numbering":"C","title":["An efficient local search framework for the minimum weighted vertex cover problem"],"prefix":"10.1016","volume":"372","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-2915-8242","authenticated-orcid":false,"given":"Ruizhi","family":"Li","sequence":"first","affiliation":[]},{"given":"Shuli","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Haochen","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2016.08.053_bib0001","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.45.2.226","article-title":"Optimized crossover for the independent set problem","volume":"45","author":"Aggarwal","year":"1997","journal-title":"Oper. Res."},{"key":"10.1016\/j.ins.2016.08.053_bib0002","series-title":"Proc. of WEA-08","first-page":"220","article-title":"Fast local search for the maximum independent set problem","author":"Andrade","year":"2008"},{"key":"10.1016\/j.ins.2016.08.053_bib0003","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.ins.2014.11.051","article-title":"An adaptive gradient descent-based local search in memetic algorithm applied to optimal controller design","volume":"299","author":"Arab","year":"2015","journal-title":"Inf. Sci."},{"issue":"3","key":"10.1016\/j.ins.2016.08.053_bib0004","first-page":"130","article-title":"A meta-heuristic algorithm for vertex covering problem based on gravity","volume":"1","author":"Balachandar","year":"2009","journal-title":"Int. J. Math. Stat. Sci."},{"key":"10.1016\/j.ins.2016.08.053_bib0005","first-page":"34","article-title":"An effective algorithm for minimum weighted vertex cover problem","volume":"4","author":"Balaji","year":"2010","journal-title":"Int. J. Comput. Math. Sci."},{"issue":"4","key":"10.1016\/j.ins.2016.08.053_bib0006","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s10878-004-4835-9","article-title":"A novel evolutionary formulation of the maximum independent set problem","volume":"8","author":"Barbosa","year":"2004","journal-title":"J. Comb. Optim."},{"issue":"17","key":"10.1016\/j.ins.2016.08.053_bib0007","first-page":"29","article-title":"The Applicability of Genetic algorithm to Vertex Cover[J]","volume":"123","author":"Bhasin","year":"2015","journal-title":"Int. J. Comput. Appl."},{"issue":"6","key":"10.1016\/j.ins.2016.08.053_bib0008","doi-asserted-by":"crossref","first-page":"1632","DOI":"10.1016\/j.asoc.2012.02.013","article-title":"A population-based iterated greedy algorithm for the minimum weight vertex cover problem[J]","volume":"12","author":"Bouamama","year":"2012","journal-title":"Appl. Soft Comput."},{"issue":"10","key":"10.1016\/j.ins.2016.08.053_bib0009","doi-asserted-by":"crossref","first-page":"1766","DOI":"10.1016\/j.disc.2015.01.041","article-title":"The maximum independent set problem in subclasses of subcubic graphs[J]","volume":"338","author":"Brause","year":"2015","journal-title":"Discrete Math."},{"key":"10.1016\/j.ins.2016.08.053_bib0010","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.dam.2014.05.042","article-title":"On the weighted k-path vertex cover problem[J]","volume":"177","author":"Bre\u0161ar","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ins.2016.08.053_bib0011","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.ins.2014.10.043","article-title":"Solving the maximally diverse grouping problem by skewed general variable neighborhood search","volume":"295","author":"Brimberg","year":"2015","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2016.08.053_bib0012","series-title":"Proc. AAAI","article-title":"Two weighting local search for minimum vertex cover","author":"Cai","year":"2015"},{"key":"10.1016\/j.ins.2016.08.053_bib0013","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.artint.2013.09.001","article-title":"Local search for Boolean Satisfiability with configuration checking and subscore","volume":"204","author":"Cai","year":"2013","journal-title":"Artif. Intell."},{"key":"10.1016\/j.ins.2016.08.053_bib0014","series-title":"Proc. AAAI","article-title":"EWLS: a new local search for minimum vertex cover","author":"Cai","year":"2010"},{"issue":"9","key":"10.1016\/j.ins.2016.08.053_bib0015","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","article-title":"Local search with edge weighting and configuration checking heuristics for minimum vertex cover","volume":"175","author":"Cai","year":"2011","journal-title":"Artif. Intell."},{"key":"10.1016\/j.ins.2016.08.053_bib0016","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1613\/jair.3907","article-title":"NuMVC: an efficient local search algorithm for minimum vertex cover","author":"Cai","year":"2013","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.ins.2016.08.053_bib0017","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ins.2015.07.008","article-title":"The relationship between attribute reducts in rough sets and minimal vertex covers of graphs","volume":"325","author":"Chen","year":"2015","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2016.08.053_bib0018","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.asoc.2016.02.003","article-title":"A rough set method for the minimum vertex cover problem of graphs[J]","volume":"42","author":"Chen","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.ins.2016.08.053_bib0019","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set-covering problem","volume":"3","author":"Chv\u00e1tal","year":"1979","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/j.ins.2016.08.053_bib0020","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1002\/rsa.20550","article-title":"On independent sets in random graphs[J]","volume":"47","author":"Coja-Oghlan","year":"2015","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ins.2016.08.053_bib0021","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.ins.2015.07.051","article-title":"An alternative artificial bee colony algorithm with destructive\u2013constructive neighbourhood operator for the problem of composing medical crews","volume":"326","author":"Delgado-Osuna","year":"2016","journal-title":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.ins.2016.08.053_bib0022","doi-asserted-by":"crossref","first-page":"439","DOI":"10.4007\/annals.2005.162.439","article-title":"On the hardness of approximating minimum vertex cover","volume":"162","author":"Dinur","year":"2005","journal-title":"Ann. Math."},{"issue":"1","key":"10.1016\/j.ins.2016.08.053_bib0023","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s00224-014-9592-2","article-title":"Advice complexity of maximum independent set in sparse and bipartite graphs[J]","volume":"56","author":"Dobrev","year":"2015","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.ins.2016.08.053_bib0024","series-title":"Proc. of EP-98","first-page":"377","article-title":"An evolutionary heuristic for the minimum vertex cover problem","author":"Evans","year":"1998"},{"key":"10.1016\/j.ins.2016.08.053_bib0025","first-page":"71","volume":"8497","author":"Fang","year":"2014"},{"key":"10.1016\/j.ins.2016.08.053_bib0026","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2014.10.035","article-title":"On the parameterized complexity of vertex cover and edge cover with connectivity constraints[J]","volume":"565","author":"Fernau","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ins.2016.08.053_bib0027","series-title":"ANTS Workshop","first-page":"452","article-title":"Kernelization as heuristic structure for the vertex cover problem","author":"Gilmour","year":"2006"},{"key":"10.1016\/j.ins.2016.08.053_bib0028","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search\u2014Part I","volume":"1","author":"Glove","year":"1989","journal-title":"ORSA J. Comput."},{"key":"10.1016\/j.ins.2016.08.053_bib0029","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search\u2014Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"issue":"3","key":"10.1016\/j.ins.2016.08.053_bib0030","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1016\/j.ejor.2014.09.036","article-title":"Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite boolean quadratic programs[J]","volume":"241","author":"Glover","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.ins.2016.08.053_bib0031","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.neunet.2015.03.013","article-title":"Incremental learning for \u03bd-support vector regression","volume":"67","author":"Gu","year":"2015","journal-title":"Neural Networks"},{"key":"10.1016\/j.ins.2016.08.053_bib0032","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2016.03.028","article-title":"A weighted local view method based on observation over ground truth for community detection","author":"Hu","year":"2016","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2016.08.053_bib0033","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ins.2015.03.075","article-title":"Dense community detection in multi-valued attributed networks","volume":"314","author":"Huang","year":"2015","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2016.08.053_bib0034","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ins.2016.02.051","article-title":"Hybrid evolutionary search for the minimum sum coloring problem of graphs","volume":"352","author":"Jin","year":"2016","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2016.08.053_bib0035","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.engappai.2014.08.007","article-title":"General swap-based multiple neighborhood tabu search for the maximum independent set problem","volume":"37","author":"Jin","year":"2015","journal-title":"Eng. Appl. Artif. Intel."},{"issue":"8","key":"10.1016\/j.ins.2016.08.053_bib0036","doi-asserted-by":"crossref","first-page":"5360","DOI":"10.1016\/j.asoc.2011.05.023","article-title":"An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem","volume":"11","author":"Jovanovic","year":"2011","journal-title":"Appl. Soft Comput. J."},{"key":"10.1016\/j.ins.2016.08.053_bib0037","series-title":"Complexity of Computer Computations","author":"Karp","year":"1972"},{"key":"10.1016\/j.ins.2016.08.053_bib0038","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/j.ins.2014.10.004","article-title":"An adaptive non-linear great deluge algorithm for the patient-admission problem","volume":"295","author":"Kifah","year":"2015","journal-title":"Inf. Sci."},{"issue":"7","key":"10.1016\/j.ins.2016.08.053_bib0039","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1007\/s11590-015-0851-1","article-title":"Exact solutions to generalized vertex covering problems: a comparison of two models[J]","volume":"9","author":"Kochenberger","year":"2015","journal-title":"Optim. Lett."},{"issue":"2","key":"10.1016\/j.ins.2016.08.053_bib0040","doi-asserted-by":"crossref","first-page":"365","DOI":"10.7151\/dmgt.1811","article-title":"Extending the MAX Algorithm for Maximum Independent Set","volume":"35","author":"L\u00ea","year":"2015","journal-title":"Discuss. Math. Graph T."},{"key":"10.1016\/j.ins.2016.08.053_bib0041","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/j.ins.2014.03.085","article-title":"Measuring the impact of MVC attack in large complex networks","volume":"278","author":"Li","year":"2014","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2016.08.053_bib0042","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.ins.2014.10.009","article-title":"Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm","volume":"316","author":"Li","year":"2015","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2016.08.053_bib0043","article-title":"A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem","author":"Li","year":"2016","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.ins.2016.08.053_bib0044","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.ins.2014.11.042","article-title":"Modified cuckoo search algorithm with self adaptive parameter method","volume":"298","author":"Li","year":"2015","journal-title":"Inf. Sci."},{"issue":"4","key":"10.1016\/j.ins.2016.08.053_bib0045","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TNB.2013.2294716","article-title":"Multiobjective binary biogeography based optimization for feature selection using gene expression data","volume":"12","author":"Li","year":"2013","journal-title":"IEEE Trans. on Nanobiosci."},{"key":"10.1016\/j.ins.2016.08.053_bib0046","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ins.2013.07.012","article-title":"Optimal topological design for distributed estimation over sensor networks","volume":"254","author":"Liu","year":"2014","journal-title":"Inf. Sci."},{"issue":"5","key":"10.1016\/j.ins.2016.08.053_bib0047","first-page":"1014","article-title":"Clause states based configuration checking in local search for satisfiability","volume":"45","author":"Luo","year":"2015","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"10.1016\/j.ins.2016.08.053_bib0048","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1587\/transinf.2014EDP7283","article-title":"Social network and tag sources based augmenting collaborative recommender system","volume":"E98-D","author":"Ma","year":"2015","journal-title":"IEICE Trans. Inf. Syst."},{"key":"10.1016\/j.ins.2016.08.053_bib0049","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.1815","article-title":"Dynamic local search for the maximum clique problem","volume":"25","author":"Pullan","year":"2006","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"2","key":"10.1016\/j.ins.2016.08.053_bib0050","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.disopt.2008.12.001","article-title":"Optimisation of unweighted\/weighted maximum independent sets and minimum vertex covers","volume":"6","author":"Pullan","year":"2009","journal-title":"Discrete Optim."},{"key":"10.1016\/j.ins.2016.08.053_bib0051","series-title":"Proc. of KI-07","first-page":"412","article-title":"A stochastic local search approach to vertex cover","author":"Richter","year":"2007"},{"key":"10.1016\/j.ins.2016.08.053_bib0052","series-title":"Proc. AAAI","article-title":"The network data repository with interactive graph analytics and visualization","author":"Rossi","year":"2015"},{"issue":"1","key":"10.1016\/j.ins.2016.08.053_bib0053","first-page":"1","article-title":"Coloring large complex networks","volume":"4","author":"Rossi","year":"2014","journal-title":"Social Net. Ana. Mining (SNAM)"},{"issue":"1\u20134","key":"10.1016\/j.ins.2016.08.053_bib0054","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/B:ANOR.0000039523.95673.33","article-title":"An ant colony optimization algorithm for the minimum weight vertex cover problem","volume":"131","author":"Shyu","year":"2004","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.ins.2016.08.053_bib0055","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.ins.2015.11.036","article-title":"Enhanced intelligent water drops and cuckoo search algorithms for solving the capacitated vehicle routing problem","volume":"334","author":"Teymourian","year":"2016","journal-title":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.ins.2016.08.053_bib0056","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ipl.2014.06.018","article-title":"A fixed-parameter algorithm for the vertex cover P3 problem[J]","volume":"115","author":"Tu.","year":"2015","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"10.1016\/j.ins.2016.08.053_bib0057","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1007\/s10732-012-9211-9","article-title":"A hybridized tabu search approach for the minimum weight vertex cover problem","volume":"18","author":"Vo\u00df","year":"2012","journal-title":"J. Heuristics"},{"key":"10.1016\/j.ins.2016.08.053_bib0058","first-page":"1","article-title":"A PTAS for minimum weighted connected vertex cover P_3 problem in 3-dimensional wireless sensor networks","author":"Wang","year":"2015","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.ins.2016.08.053_bib0059","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.tcs.2015.01.005","article-title":"A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs[J]","volume":"571","author":"Wang","year":"2015","journal-title":"Theor. Comput. Sci."},{"issue":"03","key":"10.1016\/j.ins.2016.08.053_bib0060","doi-asserted-by":"crossref","first-page":"303","DOI":"10.4236\/jss.2016.43037","article-title":"A neighborhood expansion tabu search algorithm based on genetic factors[J]","volume":"4","author":"Wang","year":"2016","journal-title":"Open J. Social Sci."},{"key":"10.1016\/j.ins.2016.08.053_bib0061","series-title":"Proc. AAAI","article-title":"Two efficient local search algorithms for maximum weight clique problem","author":"Wang","year":"2016"},{"key":"10.1016\/j.ins.2016.08.053_bib0062","doi-asserted-by":"crossref","DOI":"10.1007\/s00521-016-2324-6","article-title":"A path cost-based GRASP for minimum independent dominating set problem","author":"Wang","year":"2016","journal-title":"Neural Comput Appl."},{"key":"10.1016\/j.ins.2016.08.053_bib0063","article-title":"A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity","author":"Wang","year":"2015","journal-title":"Science China Info Sci."},{"issue":"1","key":"10.1016\/j.ins.2016.08.053_bib0064","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ins.2014.10.040","article-title":"A rapid learning algorithm for vehicle classification","volume":"295","author":"Wen","year":"2015","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2016.08.053_bib0065","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.ins.2015.11.029","article-title":"A clique-based exact method for optimal winner determination in combinatorial auctions","volume":"334","author":"Wu","year":"2016","journal-title":"Inf. Sci."},{"issue":"8","key":"10.1016\/j.ins.2016.08.053_bib0066","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1002\/sec.864","article-title":"Steganalysis of least significant bit matching using multi-order differences","volume":"7","author":"Xia","year":"2014","journal-title":"Secur. Commun. Netw."},{"key":"10.1016\/j.ins.2016.08.053_bib0067","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.ins.2015.07.009","article-title":"Meta-harmony search algorithm for the vehicle routing problem with time windows","volume":"325","author":"Yassen","year":"2015","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2016.08.053_bib0068","doi-asserted-by":"crossref","DOI":"10.1007\/s00521-016-2339-z","article-title":"Local search algorithm with path relinking for single batch-processing machine scheduling problem","author":"Zhang","year":"2016","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.ins.2016.08.053_bib0069","first-page":"1","article-title":"Multi-start iterated tabu search for the minimum weight vertex cover problem","author":"Zhou","year":"2015","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.ins.2016.08.053_bib0070","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1166\/jctn.2016.4869","article-title":"Two local search algorithms for partition vertex cover problem","volume":"13","author":"Zhou","year":"2016","journal-title":"J. Comput. Theor. Nanosci."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025516306259?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025516306259?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T17:03:01Z","timestamp":1568307781000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025516306259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":70,"alternative-id":["S0020025516306259"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2016.08.053","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2016,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient local search framework for the minimum weighted vertex cover problem","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2016.08.053","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}