{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T13:58:10Z","timestamp":1774965490783,"version":"3.50.1"},"reference-count":66,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0377-2217(00)00100-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:57:20Z","timestamp":1027627040000},"page":"449-467","source":"Crossref","is-referenced-by-count":1522,"title":["Variable neighborhood search: Principles and applications"],"prefix":"10.1016","volume":"130","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00100-4_BIB1","series-title":"Cluster Analysis for Application","author":"Anderberg","year":"1973"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB2","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","article-title":"A note on solving large p-median problems","volume":"21","author":"Beasley","year":"1985","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB3","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","article-title":"Fast algorithms for geometric traveling salesman problem","volume":"4","author":"Bentley","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","article-title":"A new adaptive multi-start technique for combinatorial global optimizations","volume":"16","author":"Boese","year":"1994","journal-title":"Operational Research Letters"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB5","first-page":"1","article-title":"A variable neighborhood algorithm for solving the continuous location-allocation problem","volume":"10","author":"Brimberg","year":"1996","journal-title":"Studies in Location Analysis"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB6","doi-asserted-by":"crossref","unstructured":"J. Brimberg, P. Hansen, N. Mladenovi\u0107, \u00c9. Taillard, Improvements and comparison of heuristics for solving the multisource Weber problem, Operations Research 48 (3) (2000)","DOI":"10.1287\/opre.48.3.444.12431"},{"issue":"2","key":"10.1016\/S0377-2217(00)00100-4_BIB7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/(SICI)1097-0118(199610)23:2<139::AID-JGT5>3.0.CO;2-U","article-title":"Fast generation of cubic graphs","volume":"23","author":"Brinkmann","year":"1996","journal-title":"Journal of Graph Theory"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB8","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1021\/ci9801419","article-title":"Variable neighborhood search for chemical graphs, Part 2, Graphs with extremal energy","volume":"39","author":"Caporossi","year":"1999","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(99)00206-X","article-title":"Variable neighborhood search for extremal graphs, 1. The AutoGraphix system","volume":"212","author":"Caporossi","year":"2000","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB10","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/opre.11.3.331","article-title":"Location\u2013allocation problems","volume":"11","author":"Cooper","year":"1963","journal-title":"Operational Research"},{"issue":"1","key":"10.1016\/S0377-2217(00)00100-4_BIB11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"The ant system: Optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics \u2013 Part B"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","article-title":"Stabilized column generation","volume":"194","author":"du Merle","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB13","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1137\/S1064827597328327","article-title":"An interior point algorithm for minimum sum-of-squares clustering","volume":"21","author":"du Merle","year":"2000","journal-title":"SIAM Journal on Scientific Computing"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search","volume":"6","author":"Feo","year":"1995","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0012-365X(88)90199-9","article-title":"On conjectures of Graffiti","volume":"72","author":"Fajtlowicz","year":"1987","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB16","first-page":"187","article-title":"On conjectures of Graffiti-II","volume":"60","author":"Fajtlowicz","year":"1987","journal-title":"Congressus Numerantium"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB17","first-page":"23","article-title":"On conjectures of Graffiti-III","volume":"66","author":"Fajtlowicz","year":"1988","journal-title":"Congressus Numerantium"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB18","first-page":"231","article-title":"On conjectures of Graffiti-IV","volume":"70","author":"Fajtlowicz","year":"1990","journal-title":"Congressus Numerantium"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB19","first-page":"367","article-title":"On conjectures of Graffiti-V","volume":"1","author":"Fajtlowicz","year":"1995","journal-title":"Seventh International Quadrennial Conference on Graph Theory"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB20","doi-asserted-by":"crossref","unstructured":"R.A. Fisher, The use of multiple measurements in taxonomic problems, in Annual Eugenics VII, Part II, 1936, pp. 179\u2013188","DOI":"10.1111\/j.1469-1809.1936.tb02137.x"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB21","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","article-title":"New insertion and postoptimization procedures for the traveling salesman problem","volume":"40","author":"Gendreau","year":"1992","journal-title":"Operational Research"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB22","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/0305-0548(95)00036-4","article-title":"The traveling salesman problem with back-hauls","volume":"23","author":"Gendreau","year":"1996","journal-title":"Computers and Operational Research"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB23","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2013 Part II","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Jounal of Computing"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB24","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search \u2013 Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB25","unstructured":"F. Glover, M. Laguna, Tabu search, in: C. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Optimization, Blackwell, Oxford, 1993, pp. 70\u2013150"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB26","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.7.4.426","article-title":"Tabu thresholding: Improved search by nonmonotonic trajectories","volume":"7","author":"Glover","year":"1995","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB27","series-title":"Tabu Search","author":"Glover","year":"1997"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB28","series-title":"Classification: Methods for the Exploratory Analysis of Multivariate Sata","author":"Gordon","year":"1981"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB29","series-title":"Mathematical Concepts in Organic Chemistry","author":"Gutman","year":"1986"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB30","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02241270","article-title":"Algorithms for the maximum satisfiability problem","volume":"44","author":"Hansen","year":"1990","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB31","unstructured":"P. Hansen, B. Jaumard, S. Krau, O. du Merle, A stabilized column generation algorithm for the multisource Weber problem (in preparation)"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB32","unstructured":"P. Hansen, B. Jaumard, N. Mladenovi\u0107, A. Parreira, Variable neighborhood search for weighted maximum satisfiability (in preparation)"},{"issue":"4","key":"10.1016\/S0377-2217(00)00100-4_BIB33","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","article-title":"Variable neighborhood search for the p-median","volume":"5","author":"Hansen","year":"1998","journal-title":"Location Science"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB34","unstructured":"P. Hansen, N. Mladenovi\u0107, J-MEANS, a new local search heuristic for minimum sum-of-squares clustering, Les Cahiers du GERAD G-99-14 and Pattern Recognition, forthcoming"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB35","doi-asserted-by":"crossref","unstructured":"P. Hansen, N. Mladenovi\u0107, An introduction to variable neighbourhood search. in: S. Voss et al. (Eds.), Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Dordrecht, 1999, pp. 433\u2013458","DOI":"10.1007\/978-1-4615-5775-3_30"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB36","unstructured":"P. Hansen, N. Mladenovi\u0107, D. Perez-Brito, Variable Neighborhood Decomposition Search, Journal of Heuristics, forthcoming"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB37","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0166-218X(94)90212-7","article-title":"Local optima topology for the k-coloring problem","volume":"49","author":"Hertz","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB38","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB39","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1071\/BT9660127","article-title":"Multidimensional Group Analysis","volume":"14","author":"Jancey","year":"1966","journal-title":"Australian Journal of Botany"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB40","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, L.A. McGeoch, The traveling salesman problem: a case study in local optimization, in: E.H.L. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, London, 1997, pp. 215\u2013310","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB41","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","article-title":"An algorithmic approach to network location problems; Part 2, the p-medians","volume":"37","author":"Kariv","year":"1969","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB42","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB43","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":"Journal de Physique"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB44","unstructured":"S. Krau, Extensions du probl\u00e8me de Weber, Ph D. Thesis, \u00c9cole Polytechnique de Montr\u00e9al (under direction of P. Hansen and B. Jaumard), 1997"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB45","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01584989","article-title":"Exact and approximate solutions to the multisource Weber problem","volume":"3","author":"Kuenne","year":"1972","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB46","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell Systems Technical Journal"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB47","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operational Research"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB48","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume":"1","author":"MacQueen","year":"1967","journal-title":"in: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB49","series-title":"Discrete Location Theory","year":"1990"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB50","unstructured":"N. Mladenovi\u0107, A variable neighborhood algorithm: A new metaheuristic for combinatorial optimization, Abstracts of papers presented at Optimization Days, Montr\u00e9al, 1995, p. 112"},{"issue":"1","key":"10.1016\/S0377-2217(00)00100-4_BIB51","first-page":"41","article-title":"A chain-interchange heuristic method","volume":"6","author":"Mladenovi\u0107","year":"1996","journal-title":"Yugoslav Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB52","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":"Computers and Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(00)00100-4_BIB53","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0969-6016(94)90032-9","article-title":"Capacitated clustering problems by hybrid simulated annealing and Tabu search","volume":"1","author":"Osman","year":"1994","journal-title":"International Transactions on Operational Research"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB54","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF02125421","article-title":"Metaheuristics: A bibliography","volume":"63","author":"Osman","year":"1996","journal-title":"Annals of Operational Research"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB55","series-title":"Combinatorial Optimization, Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB56","series-title":"Modern Heuristic Techniques for Combinatorial Problems","year":"1993"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB57","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSLIB \u2013 a traveling salesman library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB58","doi-asserted-by":"crossref","unstructured":"M.G.C. Resende, L.S. Pitsoulis, P.M. Pardalos, Approximate solution of weighted max-sat problems using GRASP, in: D. Du, J. Gu, P.M. Pardalos, (Eds.), Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 35, American Mathematical Society, Providence, RI, 1997","DOI":"10.1090\/dimacs\/035\/11"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB59","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0377-2217(96)00141-5","article-title":"An efficient Tabu search procedure for the p-median problem","volume":"96","author":"Rolland","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB60","unstructured":"K.E. Rosing, Private communication"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB61","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0377-2217(96)00100-2","article-title":"Heuristic concentration: Two stage solution construction","volume":"97","author":"Rosing","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB62","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0377-2217(97)00310-X","article-title":"Heuristic concentration and Tabu search: A head to head comparison","volume":"104","author":"Rosing","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB63","series-title":"Cluster Dissection and Analysis (Theory, Fortran Programs, Examples)","author":"Sp\u00e4th","year":"1985"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB64","unstructured":"N. Thabet, Des algorithmes de g\u00e9n\u00e9ration de colonnes pour le probl\u00e8me de la p-mediane, Master thesis, \u00c9cole des HEC (under direction of P. Hansen), 1998"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB65","first-page":"49","article-title":"A reverse elimination approach for the p-median problem","volume":"8","author":"Voss","year":"1996","journal-title":"Studies in Locational Analysis"},{"key":"10.1016\/S0377-2217(00)00100-4_BIB66","first-page":"95","article-title":"A fast algorithm for the greedy interchange for large-scale clustering and median location problems","volume":"21","author":"Whitaker","year":"1863","journal-title":"INFOR"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001004?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001004?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T20:32:20Z","timestamp":1579120340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700001004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":66,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0377221700001004"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00100-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}