{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:57:56Z","timestamp":1772297876293,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1023\/a:1011336210885","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T09:44:13Z","timestamp":1040636653000},"page":"335-350","source":"Crossref","is-referenced-by-count":220,"title":["Variable Neighborhood Decomposition Search"],"prefix":"10.1007","volume":"7","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]},{"given":"Dionisio","family":"Perez-Britos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"338230_CR1","volume-title":"Neural Networks for Computing","author":"E.B. Baum","year":"1986","unstructured":"Baum, E.B. (1986). \u201cToward Practical \u2018Neural\u2019 Computation for Combinatorial Optimization Problems.\u201d In J. Denker (ed.), Neural Networks for Computing. New York: American Institute of Physics."},{"key":"338230_CR2","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","volume":"21","author":"J.E. Beasley","year":"1985","unstructured":"Beasley, J.E. (1985). \u201cA Note on Solving Large p-Median Problems.\u201d European Journal of Operational Research 21, 270\u2013273.","journal-title":"European Journal of Operational Research"},{"key":"338230_CR3","doi-asserted-by":"crossref","DOI":"10.1515\/9781400874651","volume-title":"Applied Dynamic Programming","author":"R. Bellman","year":"1962","unstructured":"Bellman, R. and S. Dreyfuss. (1962). Applied Dynamic Programming, Princeton: Princeton University Press."},{"key":"338230_CR4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K.D. Boese","year":"1994","unstructured":"Boese, K.D., A.B. Kahng, and S. Muddu. (1994). \u201cA New Adaptive Multi-Start Technique for Combinatorial Global Optimizations.\u201d Operations Research Letters 16, 101\u2013113.","journal-title":"Operations Research Letters"},{"issue":"6","key":"338230_CR5","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/mnsc.35.6.645","volume":"35","author":"M.L. Brandeau","year":"1989","unstructured":"Brandeau, M.L. and S.S. Chiu. (1989). \u201cAn Overview of Representative Problems in Location Research.\u201d Management Science 35(6), 645\u2013674.","journal-title":"Management Science"},{"key":"338230_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(91)90336-T","volume":"52","author":"E.M. Captivo","year":"1991","unstructured":"Captivo, E.M. (1991). \u201cFast Primal and Dual Heuristics for the p-Median Location Problem.\u201d European Journal of Operational Research 52, 65\u201374.","journal-title":"European Journal of Operational Research"},{"key":"338230_CR7","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R. Carraghan","year":"1990","unstructured":"Carraghan, R. and P.M. Pardalos. (1990). \u201cAn Exact Algorithm for the Maximum Clique Problem.\u201d Operations Research Letters 9, 375\u2013382.","journal-title":"Operations Research Letters"},{"key":"338230_CR8","volume-title":"Graph Theory: An Algorithmic Approach","author":"N. Christofides","year":"1975","unstructured":"Christofides, N. (1975). Graph Theory: An Algorithmic Approach. New York: Academic Press."},{"key":"338230_CR9","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G. Cornuejols","year":"1977","unstructured":"Cornuejols, G., M.L. Fisher, and G.L. Nemhauser. (1977). \u201cLocation of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms.\u201d Management Science 23, 789\u2013810.","journal-title":"Management Science"},{"issue":"3","key":"338230_CR10","first-page":"307","volume":"71","author":"P.J. Densham","year":"1992","unstructured":"Densham, P.J. and G. Rushton. (1992). \u201cA More Efficient Heuristic for Solving Large p-Median Problems.\u201d Papers in Regional Science 71(3), 307\u2013329.","journal-title":"Papers in Regional Science"},{"key":"338230_CR11","volume-title":"Facility Location. A survey of Applications and Methods","year":"1995","unstructured":"Drezner, Z. (ed.). (1995). Facility Location. A survey of Applications and Methods. New York: Springer."},{"key":"338230_CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O. du Merle","year":"1999","unstructured":"du Merle, O., D. Villeneuve, J. Desrosiers, and P. Hansen. (1999). \u201cStabilized Column Generation.\u201d Discrete Mathematics 194, 229\u2013237.","journal-title":"Discrete Mathematics"},{"key":"338230_CR13","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D. Erlenkotter","year":"1978","unstructured":"Erlenkotter, D. (1978). \u201cA Dual-Based Procedure for Uncapacitated Facility Location.\u201d Operations Research 26, 992\u20131009.","journal-title":"Operations Research"},{"key":"338230_CR14","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1287\/opre.28.5.1112","volume":"28","author":"R.D. Galvao","year":"1980","unstructured":"Galvao, R.D. (1980). \u201cA Dual-Bounded Algorithm for the p-Median Problem.\u201d Operations Research 28, 1112\u20131121.","journal-title":"Operations Research"},{"key":"338230_CR15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). \u201cTabu Search\u2014Part I.\u201d ORSA Journal on Computing 1, 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"338230_CR16","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). \u201cTabu Search\u2014Part II.\u201d ORSA Journal on Computing 2, 4\u201332.","journal-title":"ORSA Journal on Computing"},{"key":"338230_CR17","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"F. Glover","year":"1993","unstructured":"Glover, F. and M. Laguna. (1993). \u201cTabu Search.\u201d In C. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems, Ch. 3, Oxford: Blackwell."},{"key":"338230_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and M. Laguna. (1997). Tabu Search. Norwell, MA: Kluwer Academic Publishers."},{"key":"338230_CR19","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0272-6963(84)90027-5","volume":"4","author":"F. Glover","year":"1984","unstructured":"Glover, F., C. McMillan, and R. Glover. (1984). \u201cA Heuristic Approach to the Employee Scheduling Problem and Some Thoughts on \u201cManagerial Robots.\u201d Journal of Operations Management 4, 113\u2013128.","journal-title":"Journal of Operations Management"},{"key":"338230_CR20","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/mnsc.7.4.379","volume":"7","author":"R.E. Griffith","year":"1961","unstructured":"Griffith, R.E. and R.A. Stewart. (1961). \u201cA Nonlinear Programming Technique for the Optimization of Continuous Processing Systems.\u201d Management Science 7, 379\u2013392.","journal-title":"Management Science"},{"key":"338230_CR21","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(85)90012-8","volume":"20","author":"P. Hanjoul","year":"1985","unstructured":"Hanjoul, P. and D. Peeters. (1985). \u201cA Comparison of Two Dual-Based Procedures for Solving the p-Median Problem.\u201d European Journal of Operational Research 20, 387\u2013396.","journal-title":"European Journal of Operational Research"},{"key":"338230_CR22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P. Hansen","year":"1990","unstructured":"Hansen, P. and B. Jaumard. (1990). \u201cAlgorithms for the Maximum Satisfiability Problem.\u201d Computing 44, 279\u2013303.","journal-title":"Computing"},{"key":"338230_CR23","first-page":"191","volume":"79","author":"P. Hansen","year":"1997","unstructured":"Hansen, P. and B. Jaumard. (1997). \u201cCluster Analysis and Mathematical Programming.\u201d Mathematical Programming 79, 191\u2013215.","journal-title":"Mathematical Programming"},{"key":"338230_CR24","first-page":"281","volume-title":"Operational Research in Industrial Systems","author":"P. Hansen","year":"1972","unstructured":"Hansen, P. and L. Kaufman. (1972). \u201cComparaison d'Algorithmes Pour le Probl\u00e8me de la Localisation des Enterp\u00f4ts.\u201d In J. Brennan (ed.), Operational Research in Industrial Systems. London: English University Press, pp. 281\u2013294."},{"key":"338230_CR25","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P. Hansen","year":"1997","unstructured":"Hansen, P. and N. Mladenovi\u0107. (1997). \u201cVariable Neighborhood Search for the p-Median.\u201d Location Science 5, 207\u2013226.","journal-title":"Location Science"},{"key":"338230_CR26","first-page":"433","volume-title":"Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization","author":"P. Hansen","year":"1998","unstructured":"Hansen, P. and N. Mladenovi\u0107. (1998). \u201cAn Introduction to Variable Neighborhood Search.\u201d In S. Voss et al. (eds.), Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization. Dordrecht: Kluwer, pp. 433\u2013458."},{"key":"338230_CR27","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1969","unstructured":"Kariv, O. and S.L. Hakimi. (1969). \u201cAn Algorithmic Approach to Network Location Problems; Part 2. The p-Medians.\u201d SIAM Journal on Applied Mathematics 37, 539\u2013560.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"338230_CR28","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., C.D. Gelatt, and M.P. Vecchi. (1983). \u201cOptimization by Simulated Annealing.\u201d Science 220, 671\u2013680.","journal-title":"Science"},{"issue":"4","key":"338230_CR29","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"A.A. Kuehn","year":"1963","unstructured":"Kuehn, A.A. and M.J. Hamburger. (1963). \u201cA Heuristic Program for Locating Warehouses.\u201d Management Science 9(4), 643\u2013666.","journal-title":"Management Science"},{"key":"338230_CR30","first-page":"138","volume":"12","author":"F.E. Maranzana","year":"1964","unstructured":"Maranzana, F.E. (1964). \u201cOn the Location of Supply Points to Minimize Transportation Costs.\u201d Operations Research Quarterly 12, 138\u2013139.","journal-title":"Operations Research Quarterly"},{"key":"338230_CR31","unstructured":"Mirchandani, P. and R. Francis (eds.). (1990). Discrete Location Theory. Wiley-Interscience."},{"key":"338230_CR32","unstructured":"Mladenovi\u0107, N. (1995). \u201cA Variable Neighborhood Algorithm\u2014A New Metaheuristic for Combinatorial Optimization.\u201d Presented at Optimization Days, Montreal."},{"key":"338230_CR33","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N. and P. Hansen. (1997). \u201cVariable Neighborhood Search.\u201d Computers and Operations Research 24, 1097\u20131100.","journal-title":"Computers and Operations Research"},{"key":"338230_CR34","unstructured":"Mladenovi\u0107, N., J.P. Moreno, and J. Moreno-Vega. (1995). \u201cTabu Search in Solving p-Facility Location \u2013 Allocation Problems.\u201d Les Cahiers du GERAD, G-95\u201338, Montreal."},{"issue":"1","key":"338230_CR35","first-page":"41","volume":"6","author":"N. Mladenovi\u0107","year":"1996","unstructured":"Mladenovi\u0107, N., J.P. Moreno, and J. Moreno-Vega. (1996). \u201cA Chain-Interchange Heuristic Method.\u201d Yugoslav Journal of Operations Research 6(1), 41\u201354.","journal-title":"Yugoslav Journal of Operations Research"},{"key":"338230_CR36","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1051\/ro\/1991250100971","volume":"25","author":"J. Moreno","year":"1991","unstructured":"Moreno, J., C. Rodrigez, and N. Jimenez. (1991). \u201cHeuristic Cluster Algorithm for Multiple Facility Location-Allocation Problem.\u201d RAIRO\u2014Recherche Operationnelle\/Operations Research 25, 97\u2013107.","journal-title":"RAIRO\u2014Recherche Operationnelle\/Operations Research"},{"issue":"3","key":"338230_CR37","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1111\/1475-3995.d01-43","volume":"1","author":"I. Osman","year":"1994","unstructured":"Osman, I. and N. Christofides. (1994). \u201cCapacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search.\u201d Int. Trans. Oper. Res. 1(3), 317\u2013336.","journal-title":"Int. Trans. Oper. Res."},{"key":"338230_CR38","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF02085654","volume":"50","author":"N.D. Pizzolato","year":"1994","unstructured":"Pizzolato, N.D. (1994). \u201cA Heuristic for Large-Size p-Median Location Problems with Application to School Location.\u201d Annals of Operations Research 50, 473\u2013485.","journal-title":"Annals of Operations Research"},{"key":"338230_CR39","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G. (1991). \u201cTSPLIB\u2014A Traveling Salesman Problem Library.\u201d ORSA Journal on Computing 3, 376\u2013384.","journal-title":"ORSA Journal on Computing"},{"key":"338230_CR40","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0377-2217(96)00141-5","volume":"96","author":"E. Rolland","year":"1996","unstructured":"Rolland, E., D.A. Schilling, and J.R. Current. (1996). \u201cAn Efficient Tabu Search Procedure for the p-Median Problem.\u201d European Journal of Operational Research 96, 329\u2013342.","journal-title":"European Journal of Operational Research"},{"key":"338230_CR41","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0377-2217(96)00100-2","volume":"97","author":"K.E. Rosing","year":"1997","unstructured":"Rosing, K.E. and C.S. ReVelle. (1997). \u201cHeuristic Concentration: Two Stage Solution Construction.\u201d European Journal of Operational Research 97, 75\u201386.","journal-title":"European Journal of Operational Research"},{"key":"338230_CR42","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0377-2217(97)00310-X","volume":"104","author":"K.E. Rosing","year":"1998","unstructured":"Rosing, K.E., C.S. ReVelle, E. Rolland, D.A. Schilling, and J.R. Current. (1998). \u201cHeuristic Concentration and Tabu Search: A Head to Head Comparison.\u201d European Journal of Operational Research 104, 93\u201399.","journal-title":"European Journal of Operational Research"},{"key":"338230_CR43","unstructured":"Rosing, K.E. (1998). Private communication."},{"issue":"5","key":"338230_CR44","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"M.B. Teitz","year":"1968","unstructured":"Teitz, M.B. and P. Bart. (1968). \u201cHeuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph.\u201d Operations Research 16(5), 955\u2013961.","journal-title":"Operations Research"},{"key":"338230_CR45","first-page":"49","volume":"8","author":"S. Voss","year":"1996","unstructured":"Voss, S. (1996). \u201cA Reverse Elimination Approach for the p-Median Problem.\u201d Studies in Locational Analysis 8, 49\u201358.","journal-title":"Studies in Locational Analysis"},{"key":"338230_CR46","first-page":"95","volume":"21","author":"R. Whitaker","year":"1983","unstructured":"Whitaker, R. (1983). \u201cA Fast Algorithm for the Greedy Interchange for Large-Scale Clustering and Median Location Problems.\u201d INFOR 21, 95\u2013108.","journal-title":"INFOR"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011336210885.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011336210885\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011336210885.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:58:55Z","timestamp":1747652335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011336210885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["338230"],"URL":"https:\/\/doi.org\/10.1023\/a:1011336210885","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}