{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:18:30Z","timestamp":1773883110418,"version":"3.50.1"},"reference-count":71,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s13675-016-0075-x","type":"journal-article","created":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T05:32:08Z","timestamp":1470979928000},"page":"423-454","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":344,"title":["Variable neighborhood search: basics and variants"],"prefix":"10.1016","volume":"5","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]},{"given":"Raca","family":"Todosijevi\u0107","sequence":"additional","affiliation":[]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1007\/s13675-016-0075-x_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10898-007-9234-1","article-title":"Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search","volume":"41","author":"audet","year":"2008","journal-title":"J Global Optim"},{"issue":"6","key":"10.1007\/s13675-016-0075-x_CR2","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1287\/mnsc.1030.0207","article-title":"Pooling problem: alternate formulations and solution methods","volume":"50","author":"audet","year":"2004","journal-title":"Manag Sci"},{"key":"10.1007\/s13675-016-0075-x_CR3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","article-title":"Pivot and complement-a heuristic for 0-1 programming","volume":"26","author":"Balas","year":"1980","journal-title":"Manag Sci"},{"key":"10.1007\/s13675-016-0075-x_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.cor.2013.08.010","article-title":"A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows","volume":"52","author":"Belhaiza","year":"2014","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1007\/s13675-016-0075-x_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1287\/ijoc.1090.0343","article-title":"A heuristic for nonlinear global optimization","volume":"22","author":"Bierlaire","year":"2010","journal-title":"INFORMS J Comput"},{"issue":"3","key":"10.1007\/s13675-016-0075-x_CR6","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","article-title":"Improvements and comparison of heuristics for solving the uncapacitated multisource weber problem","volume":"48","author":"Brimberg","year":"2000","journal-title":"Oper Res"},{"key":"10.1007\/s13675-016-0075-x_CR7","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"},{"issue":"1","key":"10.1007\/s13675-016-0075-x_CR8","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","article-title":"Minlplib\u2014a collection of test models for mixed-integer nonlinear programming","volume":"15","author":"Bussieck","year":"2003","journal-title":"INFORMS J Comput"},{"issue":"9","key":"10.1007\/s13675-016-0075-x_CR9","doi-asserted-by":"crossref","first-page":"2206","DOI":"10.1016\/j.cor.2011.11.003","article-title":"Gaussian variable neighborhood search for continuous optimization","volume":"39","author":"Carrizosa","year":"2012","journal-title":"Comput Oper Res"},{"issue":"2","key":"10.1007\/s13675-016-0075-x_CR10","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.ejor.2013.04.027","article-title":"Variable neighborhood search for minimum sum-of-squares clustering on networks","volume":"230","author":"Carrizosa","year":"2013","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13675-016-0075-x_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/B:HEUR.0000026897.40171.1a","article-title":"Cooperative parallel variable neighborhood search for the p-median","volume":"10","author":"Crainic","year":"2004","journal-title":"J Heuristics"},{"key":"10.1007\/s13675-016-0075-x_CR12","unstructured":"Davidovic T, Crainic TG (2013) Parallelization strategies for variable neighborhood search. Tecnical report CIRRELT\u20142013\u201347"},{"issue":"1","key":"10.1007\/s13675-016-0075-x_CR13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","article-title":"Neighborhood portfolio approach for local search applied to timetabling problems","volume":"5","author":"Di Gaspero","year":"2006","journal-title":"J Math Model Algorithms"},{"key":"10.1007\/s13675-016-0075-x_CR14","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.cie.2015.03.006","article-title":"Variable neighborhood search for a dynamic rich vehicle routing problem with time windows","volume":"85","author":"de Armas","year":"2015","journal-title":"Comput Indus Eng"},{"key":"10.1007\/s13675-016-0075-x_CR15","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1016\/j.ejor.2006.06.052","article-title":"A continuous variable neighbourhood search heuristic for finding the tridimensional structure of a molecule","volume":"185","author":"Dra\u017ei\u0107","year":"2008","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0075-x_CR16","doi-asserted-by":"crossref","unstructured":"Dra\u017ei\u0107 M, Dra\u017ei\u0107 Z, Mladenovi\u0107 N, Uro\u0161evi\u0107 D, Zhao QH (2014) Continuous variable neighbourhood search with modified nelder\u2013mead for non-differentiable optimization. IMA J Manag Math. doi:10.1093\/imaman\/dpu012","DOI":"10.1093\/imaman\/dpu012"},{"key":"10.1007\/s13675-016-0075-x_CR17","doi-asserted-by":"crossref","unstructured":"Drazi\u0107 M, Kovacevic-Vujci\u0107 V, Cangalovi\u0107 M, Mladenovi\u0107 N (2006) Glob\u2014a new vns-based software for global optimization. In: Global optimization, Springer, pp 135\u2013154","DOI":"10.1007\/0-387-30528-9_6"},{"issue":"1","key":"10.1007\/s13675-016-0075-x_CR18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.ijpe.2012.10.013","article-title":"A parallel variable neighborhood search for the multi-objective sustainable post-sales network design problem","volume":"145","author":"Eskandarpour","year":"2013","journal-title":"Int J Prod Econ"},{"issue":"1","key":"10.1007\/s13675-016-0075-x_CR19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","article-title":"The feasibility pump","volume":"104","author":"Fischetti","year":"2005","journal-title":"Math Program"},{"key":"10.1007\/s13675-016-0075-x_CR20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","article-title":"Local branching","volume":"98","author":"Fischetti","year":"2003","journal-title":"Math Prog"},{"issue":"2","key":"10.1007\/s13675-016-0075-x_CR21","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1137\/S1052623494268455","article-title":"Numerical experience with lower bounds for miqp branch-and-bound","volume":"8","author":"Fletcher","year":"1998","journal-title":"SIAM J Optim"},{"issue":"3","key":"10.1007\/s13675-016-0075-x_CR22","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1023\/A:1015013919497","article-title":"The parallel variable neighborhood search for the p-median problem","volume":"8","author":"Garc\u00eda-L\u00f3pez","year":"2002","journal-title":"J Heuristics"},{"issue":"4","key":"10.1007\/s13675-016-0075-x_CR23","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1137\/S1052623499350013","article-title":"Snopt: an sqp algorithm for large-scale constrained optimization","volume":"12","author":"Gill","year":"2002","journal-title":"SIAM J Optim"},{"issue":"2","key":"10.1007\/s13675-016-0075-x_CR24","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0272-6963(84)90027-5","article-title":"A heuristic programming approach to the employee scheduling problem and some thoughts on managerial robots","volume":"4","author":"Glover","year":"1984","journal-title":"J Oper Manag"},{"key":"10.1007\/s13675-016-0075-x_CR25","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.endm.2010.05.096","article-title":"Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility","volume":"36","author":"Hanafi","year":"2010","journal-title":"Electron Notes Discrete Math"},{"key":"10.1007\/s13675-016-0075-x_CR26","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1016\/j.endm.2010.05.112","article-title":"Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem","volume":"36","author":"Hanafi","year":"2010","journal-title":"Electron Notes Discrete Math"},{"issue":"4","key":"10.1007\/s13675-016-0075-x_CR27","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1287\/ijoc.1060.0196","article-title":"Primal-dual variable neighborhood search for the simple plant-location problem","volume":"19","author":"Hansen","year":"2007","journal-title":"INFORMS J Comput"},{"issue":"5","key":"10.1007\/s13675-016-0075-x_CR28","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1016\/j.dam.2005.05.020","article-title":"First vs. best improvement: an empirical study","volume":"154","author":"Hansen","year":"2006","journal-title":"Discrete Appl Math"},{"issue":"1","key":"10.1007\/s13675-016-0075-x_CR29","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","article-title":"Variable neighbourhood search: methods and applications","volume":"175","author":"Hansen","year":"2010","journal-title":"Ann Oper Res"},{"issue":"4","key":"10.1007\/s13675-016-0075-x_CR30","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","article-title":"Variable neighborhood decomposition search","volume":"7","author":"Hansen","year":"2001","journal-title":"J Heuristics"},{"issue":"10","key":"10.1007\/s13675-016-0075-x_CR31","doi-asserted-by":"crossref","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","article-title":"Variable neighborhood search and local branching","volume":"33","author":"Hansen","year":"2006","journal-title":"Comput Oper Res"},{"issue":"2","key":"10.1007\/s13675-016-0075-x_CR32","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","article-title":"A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem","volume":"206","author":"Ili\u0107","year":"2010","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0075-x_CR33","series-title":"Local search in combinatorial optimization","first-page":"215","article-title":"The traveling salesman problem: a case study in local optimization","author":"Johnson","year":"1997"},{"key":"10.1007\/s13675-016-0075-x_CR34","doi-asserted-by":"crossref","first-page":"43","DOI":"10.4018\/jamc.2012100103","article-title":"A filter-and-fan metaheuristic for the 0-1 multidimensional knapsack problem","volume":"3","author":"Khemakhem","year":"2012","journal-title":"Int. J. Appl Metaheuristic Comput"},{"key":"10.1007\/s13675-016-0075-x_CR35","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1051\/jphys:019850046080127700","article-title":"Configuration space analysis of traveling salesman problems","volume":"46","author":"Kirkpatrick","year":"1985","journal-title":"J Phys"},{"issue":"7","key":"10.1007\/s13675-016-0075-x_CR36","doi-asserted-by":"crossref","first-page":"1506","DOI":"10.1016\/j.cor.2011.08.022","article-title":"A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine","volume":"39","author":"Kirlik","year":"2012","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-016-0075-x_CR37","unstructured":"Knausz M (2008) Parallel variable neighbourhood search for the car sequencing problem. Tecnical report, Fakultat fur Informatik der Technischen Universitat Wien"},{"key":"10.1007\/s13675-016-0075-x_CR38","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1016\/j.cor.2009.09.010","article-title":"Variable neighbourhood decomposition search for 0-1 mixed integer programs","volume":"37","author":"Lazi\u0107","year":"2010","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-016-0075-x_CR39","doi-asserted-by":"crossref","unstructured":"Lazi\u0107 J, Todosijevi\u0107 R, Hanafi S, Mladenovi\u0107 N (2014) Variable and single neighbourhood diving for mip feasibility. Yugoslav J Oper Res. doi:10.2298\/YJOR140417027L","DOI":"10.2298\/YJOR140417027L"},{"key":"10.1007\/s13675-016-0075-x_CR40","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.asoc.2014.07.005","article-title":"A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem","volume":"24","author":"Li","year":"2014","journal-title":"Appl Soft Comput"},{"key":"10.1007\/s13675-016-0075-x_CR41","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10898-007-9218-1","article-title":"Double variable neighbourhood search with smoothing for the molecular distance geometry problem","volume":"43","author":"Liberti","year":"2009","journal-title":"J Global Optim"},{"key":"10.1007\/s13675-016-0075-x_CR42","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s12532-011-0031-y","article-title":"A recipe for finding good solutions to MINLPs","volume":"3","author":"Liberti","year":"2011","journal-title":"Math Program Comput"},{"key":"10.1007\/s13675-016-0075-x_CR43","series-title":"MATHEURISTICS: hybridizing metaheuristics and mathematical programming, Operations Research\/Computer Science Interface Series","first-page":"231","article-title":"A good recipe for solving minlps","author":"Liberti","year":"2010"},{"issue":"2","key":"10.1007\/s13675-016-0075-x_CR44","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10732-010-9128-0","article-title":"Neighborhood analysis: a case study on curriculum-based course timetabling","volume":"17","author":"L\u00fc","year":"2011","journal-title":"J Heuristics"},{"key":"10.1007\/s13675-016-0075-x_CR45","doi-asserted-by":"crossref","unstructured":"Mjirda A, Todosijevi\u0107 R, Hanafi S, Hansen P, Mladenovi\u0107 N (2016) Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int Trans Oper Res. doi:10.1111\/itor.12282","DOI":"10.1111\/itor.12282"},{"issue":"3","key":"10.1007\/s13675-016-0075-x_CR46","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1016\/j.ejor.2006.12.064","article-title":"General variable neighborhood search for the continuous optimization","volume":"191","author":"Mladenovi\u0107","year":"2008","journal-title":"Eur J Oper Res"},{"issue":"11","key":"10.1007\/s13675-016-0075-x_CR47","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput Oper Res"},{"issue":"2","key":"10.1007\/s13675-016-0075-x_CR48","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0377-2217(02)00833-0","article-title":"Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search","volume":"151","author":"Mladenovi\u0107","year":"2003","journal-title":"Eur J Oper Res"},{"issue":"9","key":"10.1007\/s13675-016-0075-x_CR49","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1016\/j.cor.2004.03.010","article-title":"Reformulation descent applied to circle packing problems","volume":"32","author":"Mladenovi\u0107","year":"2005","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1007\/s13675-016-0075-x_CR50","doi-asserted-by":"crossref","first-page":"19","DOI":"10.2298\/YJOR120530015M","article-title":"An efficient general variable neighborhood search for large travelling salesman problem with time windows","volume":"23","author":"Mladenovi\u0107","year":"2013","journal-title":"Yugoslav J Oper Res"},{"key":"10.1007\/s13675-016-0075-x_CR51","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.cor.2013.04.015","article-title":"Two level general variable neighborhood search for attractive traveling salesman problem","volume":"52","author":"Mladenovi\u0107","year":"2014","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-016-0075-x_CR52","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107 N, Uro\u0161evi\u0107 D, Perez-Brito D (2014) Variable neighborhood search for minimum linear arrangement problem. Yugoslav J Oper Res. doi:10.2298\/YJOR140928038M","DOI":"10.2298\/YJOR140928038M"},{"key":"10.1007\/s13675-016-0075-x_CR53","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.endm.2014.11.027","article-title":"A hybrid variable neighborhood search algorithm for targeted offers in direct marketing","volume":"47","author":"Oliveira","year":"2015","journal-title":"Electron Notes Discrete Math"},{"issue":"5","key":"10.1007\/s13675-016-0075-x_CR54","doi-asserted-by":"crossref","first-page":"2242","DOI":"10.1016\/j.asoc.2013.01.016","article-title":"Variable formulation search for the cutwidth minimization problem","volume":"13","author":"Pardo","year":"2013","journal-title":"Appl Soft Comput"},{"key":"10.1007\/s13675-016-0075-x_CR55","doi-asserted-by":"crossref","unstructured":"Pirkwieser S, Raidl GR (2009) Multiple variable neighborhood search enriched with ilp techniques for the periodic vehicle routing problem with time windows. In: Hybrid metaheuristics. Springer, pp 45\u201359","DOI":"10.1007\/978-3-642-04918-7_4"},{"issue":"2","key":"10.1007\/s13675-016-0075-x_CR56","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF03343534","article-title":"A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows","volume":"1","author":"Polacek","year":"2008","journal-title":"BuR Bus Res"},{"issue":"1","key":"10.1007\/s13675-016-0075-x_CR57","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10479-009-0656-7","article-title":"Ejection chain and filter-and-fan methods in combinatorial optimization","volume":"175","author":"Rego","year":"2010","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13675-016-0075-x_CR58","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB\u2014a traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J Comput"},{"key":"10.1007\/s13675-016-0075-x_CR59","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.endm.2014.11.012","article-title":"Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies","volume":"47","author":"S\u00e1nchez-Oro","year":"2015","journal-title":"Electron Notes Discrete Math"},{"issue":"2","key":"10.1007\/s13675-016-0075-x_CR60","first-page":"117","article-title":"Parallel variable neighbourhood search algorithms for job shop scheduling problems","volume":"18","author":"Sevkli","year":"2007","journal-title":"IMA J Manag Math"},{"issue":"2","key":"10.1007\/s13675-016-0075-x_CR61","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.ejor.2016.01.014","article-title":"Nested general variable neighborhood search for the periodic maintenance problem","volume":"252","author":"Todosijevi\u0107","year":"2016","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0075-x_CR62","doi-asserted-by":"crossref","unstructured":"Todosijevi\u0107 R, Hanafi S, Uro\u0161evi\u0107 D, Jarboui B, Gendron B (2016) A general variable neighborhood search for the swap-body vehicle routing problem. Comput Oper Res. doi:10.1016\/j.cor.2016.01.016","DOI":"10.1016\/j.cor.2016.01.016"},{"key":"10.1007\/s13675-016-0075-x_CR63","doi-asserted-by":"crossref","unstructured":"Todosijevi\u0107 R, Mjirda A, Mladenovi\u0107 M, Hanafi S, Gendron B (2014) A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim Lett. doi:10.1007\/s11590-014-0788-9","DOI":"10.1007\/s11590-014-0788-9"},{"key":"10.1007\/s13675-016-0075-x_CR64","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.endm.2012.10.021","article-title":"Vns based heuristic for solving the unit commitment problem","volume":"39","author":"Todosijevi\u0107","year":"2012","journal-title":"Electron Notes Discrete Math"},{"key":"10.1007\/s13675-016-0075-x_CR65","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.ijepes.2015.12.031","article-title":"Adaptive general variable neighborhood search heuristics for solving the unit commitment problem","volume":"78","author":"Todosijevi\u0107","year":"2016","journal-title":"Int J Electr Power Energy Syst"},{"key":"10.1007\/s13675-016-0075-x_CR66","doi-asserted-by":"crossref","unstructured":"Todosijevi\u0107 R, Uro\u0161evi\u0107 D, Mladenovi\u0107 N, Hanafi S (2015) A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. Optim Lett. doi:10.1007\/s11590-015-0867-6","DOI":"10.1007\/s11590-015-0867-6"},{"issue":"2","key":"10.1007\/s13675-016-0075-x_CR67","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1016\/j.jmaa.2006.06.025","article-title":"Solving the unconstrained optimization problem by a variable neighborhood search","volume":"328","author":"Toksar\u0131","year":"2007","journal-title":"J Math Anal Appl"},{"issue":"1","key":"10.1007\/s13675-016-0075-x_CR68","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/s10479-012-1124-3","article-title":"Multi-neighborhood tabu search for the maximum weight clique problem","volume":"196","author":"Wu","year":"2012","journal-title":"Ann Oper Res"},{"issue":"1","key":"10.1007\/s13675-016-0075-x_CR69","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1016\/j.eswa.2009.06.007","article-title":"Flexible job-shop scheduling with parallel variable neighborhood search algorithm","volume":"37","author":"Yazdani","year":"2010","journal-title":"Expert Syst Appl"},{"key":"10.1007\/s13675-016-0075-x_CR70","first-page":"22","article-title":"A parametric simplex search for unconstrained optimization problem","volume":"8","author":"Zhao","year":"2012","journal-title":"Trans Adv Res"},{"issue":"12","key":"10.1007\/s13675-016-0075-x_CR71","doi-asserted-by":"crossref","first-page":"3263","DOI":"10.1016\/j.cor.2009.03.005","article-title":"A restarted and modified simplex search for unconstrained optimization","volume":"36","author":"Zhao","year":"2009","journal-title":"Comput Oper Res"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-016-0075-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0075-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000873?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000873?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0075-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0075-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:25Z","timestamp":1761882385000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":71,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["S2192440621000873"],"URL":"https:\/\/doi.org\/10.1007\/s13675-016-0075-x","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2017,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Variable neighborhood search: basics and variants","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-016-0075-x","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2017 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}