{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:17:55Z","timestamp":1773883075055,"version":"3.50.1"},"reference-count":277,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,11,8]],"date-time":"2008-11-08T00:00:00Z","timestamp":1226102400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10288-008-0089-1","type":"journal-article","created":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T17:56:19Z","timestamp":1226080579000},"page":"319-360","source":"Crossref","is-referenced-by-count":215,"title":["Variable neighbourhood search: methods and applications"],"prefix":"10.1007","volume":"6","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 A.","family":"Moreno P\u00e9rez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,8]]},"reference":[{"key":"89_CR1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-3-540-78985-7_13","volume":"128","author":"A Abraham","year":"2008","unstructured":"Abraham A, Liu H, Zhao M (2008) Particle swarm scheduling for work-flow applications in distributed computing environments. Stud Comput Intell 128: 327\u2013342","journal-title":"Stud Comput Intell"},{"issue":"3","key":"89_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s11222-006-8079-7","volume":"16","author":"E Alba","year":"2006","unstructured":"Alba E, Dom\u00ednguez E (2006) Comparative analysis of modern optimization tools for the p-median problem. Stat Comput 16(3): 251\u2013260","journal-title":"Stat Comput"},{"issue":"1","key":"89_CR3","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.ijpe.2007.02.052","volume":"114","author":"B Almada-Lobo","year":"2008","unstructured":"Almada-Lobo B, Oliveira JF, Carravilla MA (2008) Production planning and scheduling in the glass container industry: A VNS approach. Int J Prod Econ 114(1): 363\u2013375","journal-title":"Int J Prod Econ"},{"issue":"5","key":"89_CR4","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1016\/j.dam.2004.09.021","volume":"154","author":"DJ Aloise","year":"2006","unstructured":"Aloise DJ, Aloise D, Rocha CTM, Ribeiro CC, Ribeiro JC, Moura LSS (2006) Scheduling workover rigs for onshore oil production. Discrete Appl Math 154(5): 695\u2013702","journal-title":"Discrete Appl Math"},{"issue":"4","key":"89_CR5","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1023\/A:1015439913121","volume":"8","author":"A Andreatta","year":"2002","unstructured":"Andreatta A, Ribeiro C (2002) Heuristics for the phylogeny problem. J Heuristics 8(4): 429\u2013447","journal-title":"J Heuristics"},{"issue":"11","key":"89_CR6","doi-asserted-by":"crossref","first-page":"3471","DOI":"10.1016\/j.cor.2006.02.009","volume":"34","author":"D Anghinolfi","year":"2007","unstructured":"Anghinolfi D, Paolucci M (2007) Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Comput Oper Res 34(11): 3471\u20133490","journal-title":"Comput Oper Res"},{"key":"89_CR7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1051\/ro:2006006","volume":"39","author":"M Aouchiche","year":"2005","unstructured":"Aouchiche M, Hansen P (2005) Recherche \u00e0 voisinage variable de graphes extr\u00e8mes 13. \u00c0 propos de la maille (French). RAIRO Oper Res 39: 275\u2013293","journal-title":"RAIRO Oper Res"},{"key":"89_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-7643-7400-6_3","volume":"VI","author":"M Aouchiche","year":"2007","unstructured":"Aouchiche M, Hansen P (2007a) Automated results and conjectures on average distance in graphs. Graph Theory Paris Trends Math VI: 21\u201336","journal-title":"Graph Theory Paris Trends Math"},{"key":"89_CR9","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.disc.2006.06.025","volume":"307","author":"M Aouchiche","year":"2007","unstructured":"Aouchiche M, Hansen P (2007b) On a conjecture about the Randic index. Discrete Math 307: 262\u2013265","journal-title":"Discrete Math"},{"key":"89_CR10","unstructured":"Aouchiche M, Hansen P (2008) Nordhaus-Gaddum relations for proximity and remoteness in graphs. Les Cahiers du GERAD G-2008-36"},{"key":"89_CR11","unstructured":"Aouchiche M, Hansen P (2009) Bounding average distance using minimum degree. Graph Theory Notes New York (in press)"},{"key":"89_CR12","first-page":"129","volume":"148","author":"M Aouchiche","year":"2001","unstructured":"Aouchiche M, Caporossi G, Cvetkovi\u0107 D (2001) Variable neighborhood search for extremal graphs 8. Variations on Graffiti 105. Congressus Numerantium 148: 129\u2013144","journal-title":"Congressus Numerantium"},{"key":"89_CR13","first-page":"281","volume-title":"Global Optimization: from Theory to Implementation","author":"M Aouchiche","year":"2005","unstructured":"Aouchiche M, Bonnefoy JM, Fidahoussen A, Caporossi G, Hansen P, Hiesse L, Lacher\u00e9 J, Monhait A (2005) Variable neighborhood search for extremal graphs 14. The AutoGraphiX 2 system. In: Liberti L, Maculan N (eds) Global Optimization: from Theory to Implementation. Springer, Berlin, pp 281\u2013309"},{"key":"89_CR14","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.endm.2005.06.090","volume":"22","author":"M Aouchiche","year":"2005","unstructured":"Aouchiche M, Caporossi G, Hansen P, Laffay M (2005b) AutoGraphiX: a survey. Electron Notes Discrete Math 22: 515\u2013520","journal-title":"Electron Notes Discrete Math"},{"issue":"3","key":"89_CR15","first-page":"541","volume":"56","author":"M Aouchiche","year":"2006","unstructured":"Aouchiche M, Hansen P, Zheng M (2006) Variable neighborhood search for extremal graphs 18. Conjectures and results about the Randic index MATCH. Commun Math Comput Chem 56(3): 541\u2013550","journal-title":"Commun Math Comput Chem"},{"issue":"2","key":"89_CR16","first-page":"365","volume":"58","author":"M Aouchiche","year":"2007","unstructured":"Aouchiche M, Caporossi G, Hansen P (2007a) Variable Neighborhood search for extremal graphs 20. Automated comparison of graph invariants. MATCH. Commun Math Comput Chem 58(2): 365\u2013384","journal-title":"Commun Math Comput Chem"},{"key":"89_CR17","unstructured":"Aouchiche M, Caporossi G, Hansen P (2007b) Variable neighborhood search for extremal graphs 27. Families of extremal graphs. Les Cahiers du GERAD G-2007-87"},{"key":"89_CR18","unstructured":"Aouchiche M, Favaron O, Hansen P (2007c) Recherche \u00e0 voisinage variable de graphes extr\u00e8mes 26. Nouveaux r\u00e9sultats sur la maille (French). Les Cahiers du GERAD G-2007-55"},{"issue":"1","key":"89_CR19","first-page":"83","volume":"58","author":"M Aouchiche","year":"2007","unstructured":"Aouchiche M, Hansen P, Zheng M (2007d) Variable Neighborhood Search for Extremal Graphs 19. Further Conjectures and Results about the Randic Index. MATCH. Commun Math Comput Chem 58(1): 83\u2013102","journal-title":"Commun Math Comput Chem"},{"issue":"3","key":"89_CR20","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1016\/j.ejor.2006.12.059","volume":"191","author":"M Aouchiche","year":"2008","unstructured":"Aouchiche M, Bell FK, Cvetkovi\u0107 D, Hansen P, Rowlinson P, Simi\u0107 SK, Stevanovi\u0107 D (2008a) Variable neighborhood search for extremal graphs 16. Some conjectures related to the largest eigenvalue of a graph. Eur J Oper Res 191(3): 661\u2013676","journal-title":"Eur J Oper Res"},{"issue":"13","key":"89_CR21","doi-asserted-by":"crossref","first-page":"2530","DOI":"10.1016\/j.dam.2008.03.011","volume":"156","author":"M Aouchiche","year":"2008","unstructured":"Aouchiche M, Brinkmann G, Hansen P (2008b) Variable neighborhood search for extremal graphs 21. Conjectures and results about the independence number. Discrete Appl Math 156(13): 2530\u20132542","journal-title":"Discrete Appl Math"},{"key":"89_CR22","doi-asserted-by":"crossref","unstructured":"Aouchiche M, Favaron O, Hansen P (2009a) Variable neighborhood search for extremal graphs 22. Extending bounds for independence to upper irredundance. Discrete Appl Math (in press)","DOI":"10.1016\/j.dam.2009.04.004"},{"key":"89_CR23","doi-asserted-by":"crossref","unstructured":"Aouchiche M, Hansen P, Stevanovi\u0107 D (2009b) Variable neighborhood search for extremal graphs 17. Further conjectures and results about the index Discusiones Mathematicae: Graph Theory (in press)","DOI":"10.7151\/dmgt.1430"},{"issue":"1","key":"89_CR24","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10732-006-9004-0","volume":"13","author":"C Archetti","year":"2007","unstructured":"Archetti C, Hertz A, Speranza MG (2007) Metaheuristics for the team orienteering problem. J Heuristics 13(1): 49\u201376","journal-title":"J Heuristics"},{"key":"89_CR25","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1287\/mnsc.1030.0207","volume":"50","author":"C Audet","year":"2004","unstructured":"Audet C, Brimberg J, Hansen P, Mladenovi\u0107 N (2004) Pooling problem: alternate formulation and solution methods. Manage Sci 50: 761\u2013776","journal-title":"Manage Sci"},{"issue":"2","key":"89_CR26","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10898-007-9234-1","volume":"41","author":"C Audet","year":"2008","unstructured":"Audet C, B\u00e1chard V, Le Digabel S (2008) Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search. J Global Optim 41(2): 299\u2013318","journal-title":"J Global Optim"},{"issue":"2","key":"89_CR27","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0377-2217(02)00832-9","volume":"151","author":"C Avanthay","year":"2003","unstructured":"Avanthay C, Hertz A, Zufferey N (2003) A variable neighborhood search for graph coloring. Eur J Oper Res 151(2): 379\u2013388","journal-title":"Eur J Oper Res"},{"key":"89_CR28","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-540-78985-7_6","volume":"128","author":"ME Aydin","year":"2008","unstructured":"Aydin ME, Sevkli M (2008) Sequential and parallel variable neighborhood search algorithms for job shop scheduling. Stud Comput Intell 128: 125\u2013144","journal-title":"Stud Comput Intell"},{"key":"89_CR29","doi-asserted-by":"crossref","unstructured":"Baum EB (1986) Toward practical \u2018neural\u2019 computation for combinatorial optimization problems. In: Denker J (ed) Neural networks for computing. American Institute of Physics, College Park (1986)","DOI":"10.1063\/1.36219"},{"issue":"10","key":"89_CR30","doi-asserted-by":"crossref","first-page":"2193","DOI":"10.1016\/S0031-3203(01)00193-5","volume":"35","author":"N Belacel","year":"2002","unstructured":"Belacel N, Hansen P, Mladenovi\u0107 N (2002) Fuzzy J-means: a new heuristic for fuzzy clustering. Pattern Recognit 35(10): 2193\u20132200","journal-title":"Pattern Recognit"},{"issue":"11","key":"89_CR31","doi-asserted-by":"crossref","first-page":"1690","DOI":"10.1093\/bioinformatics\/bth142","volume":"20","author":"N Belacel","year":"2004","unstructured":"Belacel N, \u010cuperlovi\u0107-Culf M, Laflamme M, Ouellette R (2004a) Fuzzy J-means and VNS methods for clustering genes from microarray data. Bioinformatics 20(11): 1690\u20131701","journal-title":"Bioinformatics"},{"key":"89_CR32","volume-title":"Artificial Intelligence and Applications","author":"N Belacel","year":"2004","unstructured":"Belacel N, \u010cuperlovi\u0107-Culf M, Ouellette R, Boulassel MR (2004b) The variable neighborhood search metaheuristic for fuzzy clustering cDNA microarray gene expression data. In: Hamza MH (eds) Artificial Intelligence and Applications. Acta Press, Calgary"},{"issue":"7","key":"89_CR33","doi-asserted-by":"crossref","first-page":"1885","DOI":"10.1016\/j.cor.2005.07.019","volume":"34","author":"N Belacel","year":"2007","unstructured":"Belacel N, Raval HB, Punnen AP (2007) Learning multicriteria fuzzy classification method PROAFTN from data. Comput Oper Res 34(7): 1885\u20131898","journal-title":"Comput Oper Res"},{"key":"89_CR34","unstructured":"Belhaiza S, de Abreu N, Hansen P, Oliveira C (2007) Variable neighborhood search for extremal graphs 11. Bounds on algebraic connectivity. In: Avis D, Hertz A, Marcotte O (eds) Graph Theory and Combinatorial Optimization, pp 1\u201316"},{"key":"89_CR35","unstructured":"Beltr\u00e1n JD, Calder\u00f3n JE, Jorge-Cabrera R, Moreno-P\u00e9rez JA, Moreno-Vega JM (2004) GRASP-VNS hybrid for the strip packing problem. In Hybrid Metaheuristics 2004, pp 79\u201390"},{"issue":"3","key":"89_CR36","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1016\/j.cor.2006.05.001","volume":"35","author":"S Benati","year":"2008","unstructured":"Benati S (2008) Categorical data fuzzy clustering: an analysis of local search heuristics. Comput Oper Res 35(3): 766\u2013775","journal-title":"Comput Oper Res"},{"issue":"3","key":"89_CR37","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/S0377-2217(01)00340-X","volume":"143","author":"S Benati","year":"2002","unstructured":"Benati S, Hansen P (2002) The maximum capture problem with random utilities: problem formulation and algorithms. Eur J Oper Res 143(3): 518\u2013530","journal-title":"Eur J Oper Res"},{"issue":"3","key":"89_CR38","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/j.ejor.2007.10.022","volume":"192","author":"M Bischoff","year":"2008","unstructured":"Bischoff M, D\u00e4chert K (2008) Allocation search methods for a generalized class of location-allocation problems. Eur J Oper Res 192(3): 793\u2013807","journal-title":"Eur J Oper Res"},{"key":"89_CR39","first-page":"222","volume":"3698","author":"J Blazewicz","year":"2005","unstructured":"Blazewicz J, Pesch E, Sterna M, Werner F (2005) Metaheuristics for late work minimization in two-machine flow shop with common due date. Lect Notes Artif Intell 3698: 222\u2013234","journal-title":"Lect Notes Artif Intell"},{"issue":"2","key":"89_CR40","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1016\/j.cor.2006.03.021","volume":"35","author":"J Blazewicz","year":"2008","unstructured":"Blazewicz J, Pesch E, Sterna M, Werner F (2008) Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. Comput Oper Res 35(2): 574\u2013599","journal-title":"Comput Oper Res"},{"issue":"2","key":"89_CR41","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejor.2005.11.011","volume":"177","author":"S Bock","year":"2007","unstructured":"Bock S, Hoberg K (2007) Detailed layout planning for irregularly-shaped machines with transportation path design. Eur J Oper Res 177(2): 693\u2013718","journal-title":"Eur J Oper Res"},{"issue":"6","key":"89_CR42","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10951-007-0043-7","volume":"10","author":"V Bouffard","year":"2007","unstructured":"Bouffard V, Ferland JA (2007) Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem. J Scheduling 10(6): 375\u2013386","journal-title":"J Scheduling"},{"issue":"4","key":"89_CR43","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","volume":"15","author":"O Br\u00e4ysy","year":"2003","unstructured":"Br\u00e4ysy O (2003) A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J Comput 15(4): 347\u2013368","journal-title":"INFORMS J Comput"},{"key":"89_CR44","first-page":"1","volume":"10","author":"J Brimberg","year":"1996","unstructured":"Brimberg J, Mladenovi\u0107 N (1996) A variable neighborhood algorithm for solving the continuous location-allocation problem. Stud Locational Anal 10: 1\u201312","journal-title":"Stud Locational Anal"},{"issue":"3","key":"89_CR45","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","volume":"48","author":"J Brimberg","year":"2000","unstructured":"Brimberg J, Hansen P, Mladenovi\u0107 N, Taillard \u00c9 (2000) Improvements and comparison of heuristics for solving the multisource Weber problem. Oper Res 48(3): 444\u2013460","journal-title":"Oper Res"},{"issue":"2","key":"89_CR46","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/opre.51.2.228.12786","volume":"51","author":"J Brimberg","year":"2003","unstructured":"Brimberg J, Hansen P, Lih K-W, Mladenovi\u0107 N, Breton M (2003) An oil pipeline design problem. Oper Res 51(2): 228\u2013239","journal-title":"Oper Res"},{"key":"89_CR47","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1057\/palgrave.jors.2601754","volume":"55","author":"J Brimberg","year":"2004","unstructured":"Brimberg J, Mladenovi\u0107 N, Salhi S (2004) The multi-source Weber problem with constant opening cost. J Oper Res Soc 55: 640\u2013646","journal-title":"J Oper Res Soc"},{"key":"89_CR48","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/imaman\/dpl002","volume":"17","author":"J Brimberg","year":"2006","unstructured":"Brimberg J, Hansen P, Mladenovi\u0107 N (2006a) Decomposition strategies for large-scale continuous location\u2013allocation problems. IMA J Manage Math 17: 307\u2013316","journal-title":"IMA J Manage Math"},{"issue":"1","key":"89_CR49","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ejor.2004.07.061","volume":"171","author":"J Brimberg","year":"2006","unstructured":"Brimberg J, Uro\u0161evi\u0107 D, Mladenovi\u0107 N (2006b) Variable neighborhood search for the vertex weighted k-cardinality tree problem. Eur J Oper Res 171(1): 74\u201384","journal-title":"Eur J Oper Res"},{"issue":"3","key":"89_CR50","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1057\/palgrave.jors.2602349","volume":"59","author":"J Brimberg","year":"2008","unstructured":"Brimberg J, Hansen P, Laporte G, Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2008a) The maximum return-on-investment plant location problem with market share. J Oper Res Soc 59(3): 399\u2013406","journal-title":"J Oper Res Soc"},{"issue":"5","key":"89_CR51","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10732-007-9046-y","volume":"14","author":"J Brimberg","year":"2008","unstructured":"Brimberg J, Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2008b) Local and variable neighborhood search for the k-cardinality subgraph problem. J Heuristics 14(5): 501\u2013517","journal-title":"J Heuristics"},{"issue":"5","key":"89_CR52","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.jmp.2007.07.001","volume":"51","author":"M Brusco","year":"2007","unstructured":"Brusco M, Steinley D (2007a) A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices. J Math Psychol 51(5): 325\u2013338","journal-title":"J Math Psychol"},{"issue":"4","key":"89_CR53","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s11336-007-9013-4","volume":"72","author":"MJ Brusco","year":"2007","unstructured":"Brusco MJ, Steinley D (2007b) A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning. Psychometrika 72(4): 583\u2013600","journal-title":"Psychometrika"},{"issue":"3","key":"89_CR54","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s11336-007-9049-5","volume":"73","author":"MJ Brusco","year":"2008","unstructured":"Brusco MJ, K\u00f6hn H-F, Stahl S (2008) Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis. Psychometrika 73(3): 503\u2013522","journal-title":"Psychometrika"},{"key":"89_CR55","doi-asserted-by":"crossref","unstructured":"Burke EK, Kendall G (2005) Search methodologies. Introductory tutorials in optimization and decision support techniques. Springer, Berlin (2005)","DOI":"10.1007\/0-387-28356-0"},{"key":"89_CR56","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-45365-2_21","volume":"2037","author":"EK Burke","year":"2001","unstructured":"Burke EK, Cowling P, Keuthen R (2001) Effective local and guided variable neighborhood search methods for the asymmetric travelling salesman problem. Lect Notes Comput Sci 2037: 203\u2013212","journal-title":"Lect Notes Comput Sci"},{"key":"89_CR57","first-page":"153","volume-title":"Metaheuristics: computer decision-making","author":"EK Burke","year":"2004","unstructured":"Burke EK, De Causmaecker P, Petrovic S, Vanden Berghe G et al (2004) Variable neighborhood search for nurse rostering problems. In: Resende M (eds) Metaheuristics: computer decision-making. Kluwer, Dordrecht, pp 153\u2013172"},{"issue":"2","key":"89_CR58","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.ejor.2007.04.030","volume":"188","author":"EK Burke","year":"2008","unstructured":"Burke EK, Curtois T, Post G, Qu R, Veltman B (2008) A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. Eur J Oper Res 188(2): 330\u2013341","journal-title":"Eur J Oper Res"},{"issue":"3","key":"89_CR59","first-page":"201","volume":"31","author":"S Canuto","year":"2001","unstructured":"Canuto S, Resende M, Ribeiro C (2001) Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 31(3): 201\u2013206","journal-title":"Networks"},{"key":"89_CR60","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(99)00206-X","volume":"212","author":"G Caporossi","year":"2000","unstructured":"Caporossi G, Hansen P (2000) Variable neighborhood search for extremal graphs 1. The AutoGraphiX system. Discrete Math 212: 29\u201344","journal-title":"Discrete Math"},{"issue":"1\u20133","key":"89_CR61","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0012-365X(03)00311-X","volume":"276","author":"G Caporossi","year":"2004","unstructured":"Caporossi G, Hansen P (2004) Variable neighborhood search for extremal graphs 5. Three ways to automate finding conjectures. Discrete Math 276(1\u20133): 81\u201394","journal-title":"Discrete Math"},{"key":"89_CR62","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1021\/ci9801419","volume":"39","author":"G Caporossi","year":"1999","unstructured":"Caporossi G, Cvetkovi\u0107 D, Gutman I, Hansen P (1999a) Variable neighborhood search for extremal graphs 2. Finding graphs with extremal energy. J Chem Inform Comput Sci 39: 984\u2013996","journal-title":"J Chem Inform Comput Sci"},{"key":"89_CR63","first-page":"10","volume":"37","author":"G Caporossi","year":"1999","unstructured":"Caporossi G, Dobrynin AA, Gutman I, Hansen P (1999b) Trees with palindromic Hosoya polynomials. Graph Theory Notes New York 37: 10\u201316","journal-title":"Graph Theory Notes New York"},{"issue":"5","key":"89_CR64","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0097-8485(99)00031-5","volume":"23","author":"G Caporossi","year":"1999","unstructured":"Caporossi G, Gutman I, Hansen P (1999c) Variable neighborhood search for extremal graphs 4. Chemical trees with extremal connectivity index. Comput Chem 23(5): 469\u2013477","journal-title":"Comput Chem"},{"key":"89_CR65","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0097-8485(02)00016-5","volume":"27","author":"G Caporossi","year":"2003","unstructured":"Caporossi G, Gutman I, Hansen P, Pavlovi\u0107 L (2003) Graphs with maximum connectivity index. Comput Biol Chem 27: 85\u201390","journal-title":"Comput Biol Chem"},{"key":"89_CR66","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/978-3-540-30214-8_19","volume":"3245","author":"G Caporossi","year":"2004","unstructured":"Caporossi G, Alamargot D, Chesnet D (2004) Using the computer to study the dynamics of the handwriting processes. Lect Notes Comput Sci 3245: 242\u2013254","journal-title":"Lect Notes Comput Sci"},{"issue":"4","key":"89_CR67","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1287\/ijoc.1060.0202","volume":"19","author":"F Carrabs","year":"2007","unstructured":"Carrabs F, Cordeau J-F, Laporte G (2007) Variable neighbourhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J Comput 19(4): 618\u2013632","journal-title":"INFORMS J Comput"},{"issue":"3","key":"89_CR68","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/ijoc.1060.0183","volume":"19","author":"E Carrizosa","year":"2007","unstructured":"Carrizosa E, Mart\u00edn-Barrag\u00e1n B, Plastria F, Romero Morales D (2007) On the selection of the globally optimal prototype subset for nearest-neighbor classification. INFORMS J Comput 19(3): 470\u2013479","journal-title":"INFORMS J Comput"},{"key":"89_CR69","doi-asserted-by":"crossref","unstructured":"Chen C-L, Chen C-L (2008) Hybrid metaheuristic for unrelated parallel machine scheduling with sequence-dependent setup times. Int J Adv Manufact Technol (in press). Published online: 26 August 2008. doi: 10.1007\/s00170-008-1692-1","DOI":"10.1007\/s00170-008-1692-1"},{"key":"89_CR70","doi-asserted-by":"crossref","unstructured":"Chyu C-C, Chen Z-J (2008) Scheduling jobs under constant period-by-period resource availability to maximize project profit at a due date. Int J Adv Manufact Technol (in press). Published online: 18 July 2008. doi: 10.1007\/s00170-008-1614-2","DOI":"10.1007\/s00170-008-1614-2"},{"key":"89_CR71","doi-asserted-by":"crossref","unstructured":"Claro J, de Sousa JP (2008) A multiobjective metaheuristic for a mean-risk multistage capacity investment problem. J Heuristics (in press). Published online: 24 July 2008. doi: 10.1007\/s10732-008-9090-2","DOI":"10.1007\/s10732-008-9090-2"},{"key":"89_CR72","doi-asserted-by":"crossref","unstructured":"Consoli S, Darby-Dowman K, Mladenovi\u0107 N, Moreno P\u00e9rez JA (2008) Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem. Eur J Oper Res. Available online 15 March 2008. doi: 10.1016\/j.ejor.2008.03.014","DOI":"10.1016\/j.ejor.2008.03.014"},{"issue":"5","key":"89_CR73","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019980525722","volume":"13","author":"MC Costa","year":"2002","unstructured":"Costa MC, Monclar FR, Zrikem M (2002) Variable neighborhood decomposition search for the optimization of power plant cable layout. J Intell Manufact 13(5): 353\u2013365","journal-title":"J Intell Manufact"},{"key":"89_CR74","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/11593577_17","volume":"3616","author":"P Cote","year":"2005","unstructured":"Cote P, Wong T, Sabourin R (2005) A hybrid multi-objective evolutionary algorithm for the uncapacitated exam proximity problem. Lect Notes Comput Sci 3616: 294\u2013312","journal-title":"Lect Notes Comput Sci"},{"issue":"3","key":"89_CR75","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/S0305-0548(03)00248-X","volume":"32","author":"PI Cowling","year":"2005","unstructured":"Cowling PI, Keuthen R (2005) Embedded local search approaches for routing optimization. Comput Oper Res 32(3): 465\u2013490","journal-title":"Comput Oper Res"},{"key":"89_CR76","first-page":"289","volume":"10","author":"T Crainic","year":"2004","unstructured":"Crainic T, Gendreau M, Hansen P, Mladenovi\u0107 N (2004) Cooperative parallel variable neighborhood search for the p-median. J Heuristics 10: 289\u2013310","journal-title":"J Heuristics"},{"key":"89_CR77","unstructured":"Crispim J, Brandao J (2001) Reactive tabu search and variable neighborhood descent applied to the vehicle routing problem with backhauls. In: MIC\u20192001, pp 631\u2013636, Porto. 2001"},{"key":"89_CR78","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/03081080108818690","volume":"49","author":"D Cvetkovic","year":"2001","unstructured":"Cvetkovic D, Simic S, Caporossi G, Hansen P (2001) Variable neighborhood search for extremal graphs 3. On the largest eigenvalue of color-constrained trees. Linear Multilinear Algebra 49: 143\u2013160","journal-title":"Linear Multilinear Algebra"},{"key":"89_CR79","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-540-78985-7_3","volume":"128","author":"J Czogalla","year":"2008","unstructured":"Czogalla J, Fink A (2008) On the effectiveness of particle swarm optimization and variable neighborhood descent for the continuous flow-shop scheduling problem. Stud Comput Intell 128: 61\u201389","journal-title":"Stud Comput Intell"},{"key":"89_CR80","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-540-78604-7_15","volume":"4972","author":"K Dahal","year":"2008","unstructured":"Dahal K, Remde S, Cowling P, Colledge N (2008) Improving metaheuristic performance by evolving a variable fitness function. Lect Notes Comput Sci 4972: 170\u2013181","journal-title":"Lect Notes Comput Sci"},{"key":"89_CR81","unstructured":"Davidon WC (1959) Variable metric algorithm for minimization. Argonne National Laboratory Report ANL-5990"},{"issue":"3","key":"89_CR82","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1142\/S021759590500056X","volume":"22","author":"T Davidovi\u0107","year":"2005","unstructured":"Davidovi\u0107 T, Hansen P, Mladenovi\u0107 N (2005) Permutation-based genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays. Asia-Pacific J Oper Res 22(3): 297\u2013326","journal-title":"Asia-Pacific J Oper Res"},{"issue":"2","key":"89_CR83","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1093\/imaman\/dpm016","volume":"18","author":"MR Paula De","year":"2007","unstructured":"De Paula MR, Ravetti MG, Mateus GR, Pardalos PM (2007) Solving parallel machines scheduling problems with sequence-dependent setup times using Variable Neighbourhood Search. IMA J Manage Math 18(2): 101\u2013115","journal-title":"IMA J Manage Math"},{"issue":"3","key":"89_CR84","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.ejor.2006.12.061","volume":"191","author":"MC Souza De","year":"2008","unstructured":"De Souza MC, Martins P (2008) Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem. Eur J Oper Res 191(3): 677\u2013690","journal-title":"Eur J Oper Res"},{"issue":"9","key":"89_CR85","doi-asserted-by":"crossref","first-page":"1613","DOI":"10.1109\/JSAC.2004.829642","volume":"22","author":"JR Degila","year":"2004","unstructured":"Degila JR, Sans\u00f2 B (2004) Topological design optimization of a Yottabit-per-second lattice network. IEEE J Selected Areas Commun 22(9): 1613\u20131625","journal-title":"IEEE J Selected Areas Commun"},{"issue":"2","key":"89_CR86","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1111\/j.1475-3995.2006.00539.x","volume":"13","author":"A Del Pia","year":"2006","unstructured":"Del Pia A, Filippi C (2006) A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. Int Trans Oper Res 13(2): 125\u2013141","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"89_CR87","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1057\/palgrave.jors.2601775","volume":"56","author":"J Desrosiers","year":"2005","unstructured":"Desrosiers J, Mladenovi\u0107 N, Villeneuve D (2005) Design of balanced MBA student teams. J Oper Res Soc 56(1): 60\u201366","journal-title":"J Oper Res Soc"},{"key":"89_CR88","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/11764298_3","volume":"4007","author":"TCS Dias","year":"2006","unstructured":"Dias TCS, De Sousa GF, Macambira EM, Cabral LDAF, Fampa MHC (2006) An efficient heuristic for the ring star problem. Lect Notes Comput Sci 4007: 24\u201335","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"89_CR89","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10479-005-2043-3","volume":"136","author":"P Dom\u00ednguez-Mar\u00edn","year":"2005","unstructured":"Dom\u00ednguez-Mar\u00edn P, Nickel S, Hansen P, Mladenovi\u0107 N (2005) Heuristic procedures for solving the discrete ordered median problem. Ann Oper Res 136(1): 145\u2013173","journal-title":"Ann Oper Res"},{"key":"89_CR90","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/0-387-30528-9_6","volume-title":"Global Optimization: from Theory to Implementation","author":"M Dra\u017ei\u0107","year":"2006","unstructured":"Dra\u017ei\u0107 M, Kovacevic-Vujci\u0107 V, Cangalovi\u0107 M, Mladenovi\u0107 N (2006) GLOB\u2014A new VNS-based software for global optimization. In: Liberti L, Maculan N (eds) Global Optimization: from Theory to Implementation. Springer, Berlin, pp 135\u2013144"},{"issue":"3","key":"89_CR91","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1016\/j.ejor.2006.06.052","volume":"185","author":"M Dra\u017ei\u0107","year":"2008","unstructured":"Dra\u017ei\u0107 M, Lavor C, Maculan N, Mladenovi\u0107 N (2008) A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule. Eur J Oper Res 185(3): 1265\u20131273","journal-title":"Eur J Oper Res"},{"issue":"1","key":"89_CR92","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"139","author":"Z Drezner","year":"2005","unstructured":"Drezner Z, Hahn PM, Taillard ED (2005) Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann Oper Res 139(1): 65\u201394","journal-title":"Ann Oper Res"},{"key":"89_CR93","doi-asserted-by":"crossref","unstructured":"Duarte A, Sanchez A, Fernandez F, Cabido R (2005) A low-level hybridization between memetic algorithm and VNS for the max-cut problem. GECCO 2005\u2014Genetic and Evolutionary Computation Conference 999\u20131006","DOI":"10.1145\/1068009.1068178"},{"issue":"1\u20133","key":"89_CR94","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, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math 194(1\u20133): 229\u2013237","journal-title":"Discrete Math"},{"key":"89_CR95","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1137\/S1064827597328327","volume":"21","author":"O Du Merle","year":"2000","unstructured":"Du Merle O, Hansen P, Jaumard B, Mladenovi\u0107 N (2000) An interior point algorithm for minimum sum-of-squares clustering. SIAM J Sci Comput 21: 1485\u20131505","journal-title":"SIAM J Sci Comput"},{"issue":"2","key":"89_CR96","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.ejor.2004.05.027","volume":"170","author":"J Fathali","year":"2006","unstructured":"Fathali J, Kakhki HT (2006) Solving the p-median problem with pos\/neg weights by variable neighborhood search and some results for special cases. Eur J Oper Res 170(2): 440\u2013462","journal-title":"Eur J Oper Res"},{"issue":"6","key":"89_CR97","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1080\/1055678021000090033","volume":"17","author":"P Festa","year":"2002","unstructured":"Festa P, Pardalos PM, Resende MGC, Ribeiro CC (2002) Randomized heuristics for the MAX-CUT problem. Optim Methods Softw 17(6): 1033\u20131058","journal-title":"Optim Methods Softw"},{"issue":"1\u20133","key":"89_CR98","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Program 98(1\u20133): 23\u201347","journal-title":"Math Program"},{"issue":"2","key":"89_CR99","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/net.20017","volume":"44","author":"M Fischetti","year":"2004","unstructured":"Fischetti M, Polo C, Scantamburlo M (2004) A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem. Networks 44(2): 61\u201372","journal-title":"Networks"},{"key":"89_CR100","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1093\/comjnl\/6.2.163","volume":"6","author":"R Fletcher","year":"1963","unstructured":"Fletcher R, Powell MJD (1963) Rapidly convergent descent method for minimization. Comput J 6: 163\u2013168","journal-title":"Comput J"},{"key":"89_CR101","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","volume":"29","author":"K Fleszar","year":"2002","unstructured":"Fleszar K, Hindi KS (2002) New heuristics for one-dimensional bin-packing. Comput Oper Res 29: 821\u2013839","journal-title":"Comput Oper Res"},{"issue":"2","key":"89_CR102","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/S0377-2217(02)00884-6","volume":"155","author":"K Fleszar","year":"2004","unstructured":"Fleszar K, Hindi KS (2004) Solving the resource-constrained project scheduling problem by a variable neighborhood search. Eur J Oper Res 155(2): 402\u2013413","journal-title":"Eur J Oper Res"},{"issue":"3","key":"89_CR103","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1016\/j.ejor.2006.12.055","volume":"191","author":"K Fleszar","year":"2008","unstructured":"Fleszar K, Hindi KS (2008) An effective VNS for the capacitated p-median problem. Eur J Oper Res 191(3): 612\u2013622","journal-title":"Eur J Oper Res"},{"key":"89_CR104","doi-asserted-by":"crossref","unstructured":"Fleszar K, Osman IH, Hindi KS (2008) A variable neighbourhood search algorithm for the open vehicle routing problem. Eur J Oper Res. Available online 22 November 2007. doi: 10.1016\/j.ejor.2007.06.064","DOI":"10.1016\/j.ejor.2007.06.064"},{"key":"89_CR105","first-page":"143","volume":"49","author":"PW Fowler","year":"2001","unstructured":"Fowler PW, Hansen P, Caporossi G, Soncini A (2001) Variable neighborhood search for extremal graphs 7. Polyenes with maximum HOMO-LUMO gap. Chem Phys Lett 49: 143\u2013146","journal-title":"Chem Phys Lett"},{"key":"89_CR106","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1057\/palgrave.jors.2601868","volume":"56","author":"C Gagn\u00e9","year":"2005","unstructured":"Gagn\u00e9 C, Gravel M, Price WL (2005) Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems. J Oper Res Soc 56: 687\u2013698","journal-title":"J Oper Res Soc"},{"issue":"9","key":"89_CR107","doi-asserted-by":"crossref","first-page":"2547","DOI":"10.1016\/j.cor.2005.07.028","volume":"33","author":"P Galinier","year":"2006","unstructured":"Galinier P, Hertz A (2006) A survey of local search methods for graph coloring. Comput Oper Res 33(9): 2547\u20132562","journal-title":"Comput Oper Res"},{"issue":"9","key":"89_CR108","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9): 2892\u20132907","journal-title":"Comput Oper Res"},{"issue":"3","key":"89_CR109","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1023\/A:1015013919497","volume":"8","author":"F Garc\u00eda-L\u00f3pez","year":"2002","unstructured":"Garc\u00eda-L\u00f3pez F, Meli\u00e1n-Batista B, Moreno-P\u00e9rez JA, Moreno-Vega JM (2002) The parallel variable neighborhood search for the p-median problem. J Heuristics 8(3): 375\u2013388","journal-title":"J Heuristics"},{"issue":"12","key":"89_CR110","doi-asserted-by":"crossref","first-page":"3549","DOI":"10.1016\/j.cor.2005.03.032","volume":"33","author":"CG Garc\u00eda","year":"2006","unstructured":"Garc\u00eda CG, P\u00e9rez-Brito D, Campos V, Mart\u00ed R (2006) Variable neighborhood search for the linear ordering problem. Comput Oper Res 33(12): 3549\u20133565","journal-title":"Comput Oper Res"},{"key":"89_CR111","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1978","unstructured":"Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"issue":"1","key":"89_CR112","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.jspi.2008.05.014","volume":"139","author":"J-J Garroi","year":"2008","unstructured":"Garroi J-J, Goos P, S\u00f6rensen K (2008) A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation. J Stat Plan Inference 139(1): 30\u201344","journal-title":"J Stat Plan Inference"},{"issue":"3","key":"89_CR113","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1016\/j.ejor.2007.04.051","volume":"191","author":"H Gavranovi\u0107","year":"2008","unstructured":"Gavranovi\u0107 H (2008) Local search and suffix tree for car-sequencing problem with colors. Eur J Oper Res 191(3): 972\u2013980","journal-title":"Eur J Oper Res"},{"key":"89_CR114","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1007\/978-3-540-70928-2_52","volume":"4403","author":"MJ Geiger","year":"2007","unstructured":"Geiger MJ, Wenger W (2007) On the interactive resolution of multi-objective vehicle routing problems. Lect Notes Comput Sci 4403: 687\u2013699","journal-title":"Lect Notes Comput Sci"},{"key":"89_CR115","doi-asserted-by":"crossref","unstructured":"Ghiani G, Hertz A, Laporte G (2002) Recent algorithmic advances for arc routing problems. In: Kozan E, Ohuchir A (eds) Operations Research\/Management Science at Work. Kluwer, Boston, pp 1\u201320","DOI":"10.1007\/978-1-4615-0819-9_1"},{"key":"89_CR116","volume-title":"Practical optimization","author":"P Gill","year":"1981","unstructured":"Gill P, Murray W, Wright M (1981) Practical optimization. Academic Press, London"},{"key":"89_CR117","volume-title":"Handbook of Metaheuristics","year":"2003","unstructured":"Glover, F, Kochenberger, G (eds) (2003) Handbook of Metaheuristics. Kluwer, Dordrecht"},{"issue":"3","key":"89_CR118","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.ejor.2006.12.065","volume":"191","author":"A Goel","year":"2008","unstructured":"Goel A, Gruhn V (2008) A general vehicle routing problem. Eur J Oper Res 191(3): 650\u2013660","journal-title":"Eur J Oper Res"},{"key":"89_CR119","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/mnsc.7.4.379","volume":"7","author":"RE Griffith","year":"1961","unstructured":"Griffith RE, Stewart RA (1961) A nonlinear programming technique for the optimization of continuous processing systems. Manage Sci 7: 379\u2013392","journal-title":"Manage Sci"},{"issue":"2","key":"89_CR120","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.ejor.2005.05.018","volume":"175","author":"SR Gupta","year":"2006","unstructured":"Gupta SR, Smith JS (2006) Algorithms for single machine total tardiness scheduling with sequence dependent setups. Eur J Oper Res 175(2): 722\u2013739","journal-title":"Eur J Oper Res"},{"key":"89_CR121","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-540-74871-7_9","volume":"4665","author":"WJ Gutjahr","year":"2007","unstructured":"Gutjahr WJ, Katzensteiner S, Reiter P (2007) A VNS algorithm for noisy problems and its application to project portfolio analysis. Lect Notes Comput Sci 4665: 93\u2013104","journal-title":"Lect Notes Comput Sci"},{"key":"89_CR122","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/S0009-2614(99)00472-8","volume":"306","author":"I Gutman","year":"1999","unstructured":"Gutman I, Miljkovi\u0107 O, Caporossi G, Hansen P (1999) Alkanes with small and large Randi\u0107 connectivity indices. Chem Phys Lett 306: 366\u2013372","journal-title":"Chem Phys Lett"},{"key":"89_CR123","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1021\/ci0342775","volume":"45","author":"I Gutman","year":"2005","unstructured":"Gutman I, Hansen P, M\u00e9lot H (2005) Variable neighborhood search for extremal graphs 10. Comparison of irregularity indices for chemical trees. J Chem Inform Model 45: 222\u2013230","journal-title":"J Chem Inform Model"},{"key":"89_CR124","doi-asserted-by":"crossref","unstructured":"Han H, Ye J, Lv Q (2007) A VNS-ANT Algorithm to QAP. In: Third International Conference on Natural Computation, vol 3, pp 426\u2013430","DOI":"10.1109\/ICNC.2007.154"},{"key":"89_CR125","first-page":"20","volume":"XLIII","author":"P Hansen","year":"2002","unstructured":"Hansen P (2002) Computers in Graph Theory. Graph Theory Notes, New York XLIII: 20\u201339","journal-title":"Graph Theory Notes, New York"},{"key":"89_CR126","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/dimacs\/069\/11","volume":"69","author":"P Hansen","year":"2005","unstructured":"Hansen P (2005) How far is, should and could be conjecture-making in graph theory an automated process?. Graph Discov Dimacs Ser Discrete Math Theor Comput Sci 69: 189\u2013229","journal-title":"Graph Discov Dimacs Ser Discrete Math Theor Comput Sci"},{"issue":"1\u20133","key":"89_CR127","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0024-3795(02)00386-5","volume":"356","author":"P Hansen","year":"2002","unstructured":"Hansen P, M\u00e9lot H (2002) Computers and discovery in algebraic graph theory. Linear Algebra Appl 356 (1\u20133): 211\u2013230","journal-title":"Linear Algebra Appl"},{"key":"89_CR128","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1021\/ci010133j","volume":"43","author":"P Hansen","year":"2003","unstructured":"Hansen P, M\u00e9lot H (2003) Variable neighborhood search for extremal graphs 6. Analysing bounds for the connectivity index. J Chem Inform Comput Sci 43: 1\u201314","journal-title":"J Chem Inform Comput Sci"},{"key":"89_CR129","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1090\/dimacs\/069\/13","volume":"69","author":"P Hansen","year":"2005","unstructured":"Hansen P, M\u00e9lot H (2005) Variable neighborhood search for extremal graphs 9. Bounding the irregularity of a graph. Graphs Discov 69: 253\u2013264","journal-title":"Graphs Discov"},{"key":"89_CR130","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, Mladenovi\u0107 N (1997) Variable neighborhood search for the p-median. Location Sci 5: 207\u2013226","journal-title":"Location Sci"},{"key":"89_CR131","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-1-4615-5775-3_30","volume-title":"Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization","author":"P Hansen","year":"1999","unstructured":"Hansen P, Mladenovi\u0107 N et al (1999) An introduction to variable neighborhood search. In: Voss S (eds) Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Dordrecht, pp 433\u2013458"},{"key":"89_CR132","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N (2001a) Variable neighborhood search: principles and applications. Eur J Oper Res 130: 449\u2013467","journal-title":"Eur J Oper Res"},{"key":"89_CR133","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"34","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N (2001b) J-Means: a new local search heuristic for minimum sum-of-squares clustering. Pattern Recognit 34: 405\u2013413","journal-title":"Pattern Recognit"},{"key":"89_CR134","first-page":"415","volume-title":"Essays and surveys in metaheuristics","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N (2001) Developments of variable neighborhood search. In: Ribeiro C, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 415\u2013440"},{"key":"89_CR135","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/0-306-48056-5_6","volume-title":"Handbook of Metaheuristics","author":"P Hansen","year":"2003","unstructured":"Hansen P, Mladenovi\u0107 N (2003) Variable neighborhood search. In: Glover F, Kochenberger G (eds) Handbook of Metaheuristics. Kluwer, Dordrecht, pp 145\u2013184"},{"key":"89_CR136","unstructured":"Hansen P, Mladenovi\u0107 N (2005) Variable Neighbourhood Search. In: Burke EK, Kendall G (eds) Search methodologies. Introductory tutorials in optimization and decision support techniques. Springer, pp 211\u2013238"},{"key":"89_CR137","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1016\/j.dam.2005.05.020","volume":"154","author":"P Hansen","year":"2006","unstructured":"Hansen P, Mladenovi\u0107 N (2006) First improvement may be better than best improvement: An empirical study. Discrete Appl Math 154: 802\u2013817","journal-title":"Discrete Appl Math"},{"issue":"1","key":"89_CR138","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s11222-007-9036-9","volume":"18","author":"P Hansen","year":"2008","unstructured":"Hansen P, Mladenovi\u0107 N (2008) Complement to a comparative analysis of heuristics for the p-median problem. Stat Comput 18(1): 41\u201346","journal-title":"Stat Comput"},{"issue":"2","key":"89_CR139","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s00357-007-0014-x","volume":"24","author":"P Hansen","year":"2007","unstructured":"Hansen P, Perron S (2007) Algorithms for $${\\mathcal {L}_1}$$ -embeddability and related problems. J Classification 24(2): 251\u2013275","journal-title":"J Classification"},{"issue":"2","key":"89_CR140","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.ijar.2007.03.001","volume":"47","author":"P Hansen","year":"2008","unstructured":"Hansen P, Perron S (2008) Merging the local and global approaches to probabilistic satisfiability. Int J Approx Reason 47(2): 125\u2013140","journal-title":"Int J Approx Reason"},{"issue":"7","key":"89_CR141","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1016\/j.dam.2007.05.044","volume":"156","author":"P Hansen","year":"2005","unstructured":"Hansen P, Stevanovi\u0107 D (2005) Variable neighborhood search for extremal graphs 15. On bags and bugs. Discrete Appl Math 156(7): 986\u2013997","journal-title":"Discrete Appl Math"},{"key":"89_CR142","doi-asserted-by":"crossref","unstructured":"Hansen P, Vuki\u010devi\u0107 D (2009) Variable neighborhood search for extremal graphs 23. On the Randic index and the chromatic number. Discrete Math (in press)","DOI":"10.1016\/j.disc.2008.12.022"},{"key":"89_CR143","unstructured":"Hansen P, Jaumard B, Mladenovi\u0107 N, Parreira A (2000) Variable neighborhood search for weighted maximum satisfiability problem. Les Cahiers du GERAD G\u20132000\u201362, HEC Montr\u00e9al, Canada"},{"issue":"4","key":"89_CR144","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N, P\u00e9rez-Brito D (2001) Variable neighborhood decomposition search. J Heuristics 7(4): 335\u2013350","journal-title":"J Heuristics"},{"issue":"1","key":"89_CR145","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.dam.2003.09.012","volume":"145","author":"P Hansen","year":"2004","unstructured":"Hansen P, Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2004) Variable neighborhood search for the maximum clique. Discrete Appl Math 145(1): 117\u2013125","journal-title":"Discrete Appl Math"},{"key":"89_CR146","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1090\/dimacs\/069\/12","volume":"69","author":"P Hansen","year":"2005","unstructured":"Hansen P, Aouchiche M, Caporossi G, M\u00e9lot H, Stevanovi\u0107 D (2005a) What forms do interesting conjectures have in graph theory?. Graph Discov Dimacs Ser Discrete Math Theor Comput Sci 69: 231\u2013251","journal-title":"Graph Discov Dimacs Ser Discrete Math Theor Comput Sci"},{"key":"89_CR147","first-page":"221","volume":"54","author":"P Hansen","year":"2005","unstructured":"Hansen P, M\u00e9lot H, Gutman I (2005b) Variable neighborhood search for extremal graphs 12. A note on the variance of bounded degrees in graphs. MATCH Commun Math Comput Chem 54: 221\u2013232","journal-title":"MATCH Commun Math Comput Chem"},{"issue":"10","key":"89_CR148","doi-asserted-by":"crossref","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","volume":"33","author":"P Hansen","year":"2006","unstructured":"Hansen P, Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2006) Variable neighborhood search and local branching. Comput Oper Res 33(10): 3034\u20133045","journal-title":"Comput Oper Res"},{"issue":"4","key":"89_CR149","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1287\/ijoc.1060.0196","volume":"19","author":"P Hansen","year":"2007","unstructured":"Hansen P, Brimberg J, Uro\u0161evi\u0107 D, Mladenovi\u0107 N (2007a) Primal-dual variable neighborhood search for the simple plant location problem. INFORMS J Comput 19(4): 552\u2013564","journal-title":"INFORMS J Comput"},{"issue":"2","key":"89_CR150","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1093\/imaman\/dpm008","volume":"18","author":"P Hansen","year":"2007","unstructured":"Hansen P, Lazi\u0107 J, Mladenovi\u0107 N (2007b) Variable neighbourhood search for colour image quantization. IMA J Manage Math 18(2): 207\u2013221","journal-title":"IMA J Manage Math"},{"issue":"3","key":"89_CR151","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.ejor.2007.02.002","volume":"191","author":"P Hansen","year":"2008","unstructured":"Hansen P, Mladenovi\u0107 N, Moreno P\u00e9rez JA (2008a) Variable neighborhood search. Eur J Oper Res 191(3): 593\u2013595","journal-title":"Eur J Oper Res"},{"issue":"3","key":"89_CR152","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/j.ejor.2006.12.057","volume":"191","author":"P Hansen","year":"2008","unstructured":"Hansen P, Oguz C, Mladenovi\u0107 N (2008b) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res 191(3): 636\u2013649","journal-title":"Eur J Oper Res"},{"key":"89_CR153","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/978-3-540-74446-7_12","volume":"4638","author":"D Haugland","year":"2007","unstructured":"Haugland D (2007) A bidirectional greedy heuristic for the subspace selection problem. Lect Notes Comput Sci 4638: 162\u2013176","journal-title":"Lect Notes Comput Sci"},{"key":"89_CR154","doi-asserted-by":"crossref","unstructured":"Hemmelmayr VC, Doerner KF, Hartl RF (2008a) A variable neighborhood search heuristic for the periodic routing problems. Eur J Oper Res. Available online 13 November 2007. doi: 10.1016\/j.ejor.2007.08.048","DOI":"10.1016\/j.ejor.2007.08.048"},{"key":"89_CR155","doi-asserted-by":"crossref","unstructured":"Hemmelmayr V, Doerner KF, Hartl RF, Savelsbergh MWP (2008b) Delivery strategies for blood products supplies OR Spectrum. Available online 19 March 2008. doi: 10.1007\/s00291-008-0134-7","DOI":"10.1007\/s00291-008-0134-7"},{"issue":"4","key":"89_CR156","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1287\/trsc.35.4.425.10431","volume":"35","author":"A Hertz","year":"2001","unstructured":"Hertz A, Mittaz M (2001) A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transp Sci 35(4): 425\u2013434","journal-title":"Transp Sci"},{"issue":"13","key":"89_CR157","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1016\/j.dam.2008.03.022","volume":"156","author":"A Hertz","year":"2008","unstructured":"Hertz A, Plumettaz M, Zufferey N (2008) Variable space search for graph coloring. Discrete Appl Math 156(13): 2551\u20132560","journal-title":"Discrete Appl Math"},{"key":"89_CR158","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1057\/palgrave.jors.2602025","volume":"57","author":"A Higgins","year":"2006","unstructured":"Higgins A, Beashel G, Harrison A (2006) Scheduling of brand production and shipping within a sugar supply chain. J Oper Res Soc 57: 490\u2013498","journal-title":"J Oper Res Soc"},{"issue":"5","key":"89_CR159","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1057\/palgrave.jors.2601525","volume":"54","author":"KS Hindi","year":"2003","unstructured":"Hindi KS, Fleszar K, Charalambous C (2003) An effective heuristic for the CLSP with setup times. J Oper Res Soc 54(5): 490\u2013498","journal-title":"J Oper Res Soc"},{"issue":"3","key":"89_CR160","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/j.ejor.2006.12.060","volume":"191","author":"H H\u00f6ller","year":"2008","unstructured":"H\u00f6ller H, Meli\u00e1n B, Voss S (2008) Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH\/WDM networks. Eur J Oper Res 191(3): 691\u2013704","journal-title":"Eur J Oper Res"},{"key":"89_CR161","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-540-78604-7_4","volume":"4972","author":"B Hu","year":"2008","unstructured":"Hu B, Raidl GR (2008) Effective neighborhood structures for the generalized traveling salesman problem. Lect Notes Comput Sci 4972: 36\u201347","journal-title":"Lect Notes Comput Sci"},{"issue":"5","key":"89_CR162","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10732-007-9046-y","volume":"14","author":"B Hu","year":"2008","unstructured":"Hu B, Leitner M, Raidl GR (2008) Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J Heuristics 14(5): 501\u2013517","journal-title":"J Heuristics"},{"key":"89_CR163","doi-asserted-by":"crossref","unstructured":"Imran A, Salhi S, Wassan NA (2008) A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. Eur J Oper Res (in press). Published online: 29 July 2008. doi: 10.1016\/j.ejor.2008.07.022","DOI":"10.1016\/j.ejor.2008.07.022"},{"issue":"8","key":"89_CR164","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1016\/j.cor.2005.02.020","volume":"33","author":"S Irnich","year":"2006","unstructured":"Irnich S, Funke B, Gr\u00fcnert T (2006) Sequential search and its application to vehicle-routing problems. Comput Oper Res 33(8): 2405\u20132429","journal-title":"Comput Oper Res"},{"issue":"1\u20132","key":"89_CR165","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/s00170-007-0944-9","volume":"37","author":"MS Jabalameli","year":"2008","unstructured":"Jabalameli MS, Ghaderi A (2008) Hybrid algorithms for the uncapacitated continuous location-allocation problem. The Int J Adv Manufact Technol 37(1\u20132): 202\u2013209","journal-title":"The Int J Adv Manufact Technol"},{"key":"89_CR166","first-page":"173","volume-title":"Metaheuristics. Progress in Complex Systems Optimization","author":"D Jovanovi\u0107","year":"2007","unstructured":"Jovanovi\u0107 D, Mladenovi\u0107 N, Ognjanovi\u0107 Z (2007) Variable neighborhood search for the probabilistic satisfiability problem. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr W, Hartl RF, Reimann M (eds) Metaheuristics. Progress in Complex Systems Optimization. Springer, Berlin, pp 173\u2013188"},{"issue":"2","key":"89_CR167","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.cie.2007.12.014","volume":"55","author":"A Joly","year":"2008","unstructured":"Joly A, Frein Y (2008) Heuristics for an industrial car sequencing problem considering paint and assembly shop objectives. Comput Ind Eng 55(2): 295\u2013310","journal-title":"Comput Ind Eng"},{"issue":"2","key":"89_CR168","first-page":"9","volume":"14","author":"K Jornsten","year":"1997","unstructured":"Jornsten K, Lokketangen A (1997) Tabu search for weighted k-cardinality trees. Asia-Pac J Oper Res 14(2): 9\u201326","journal-title":"Asia-Pac J Oper Res"},{"issue":"2","key":"89_CR169","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1093\/imaman\/dpm014","volume":"18","author":"A Karam","year":"2007","unstructured":"Karam A, Caporossi G, Hansen P (2007) Arbitrary-norm hyperplane separation by Variable Neighbourhood Search. IMA J Manage Math 18(2): 173\u2013190","journal-title":"IMA J Manage Math"},{"key":"89_CR170","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/11925903_12","volume":"4287","author":"S Kawashimo","year":"2006","unstructured":"Kawashimo S, Ono H, Sadakane K, Yamashita M (2006) DNA sequence design by dynamic neighborhood searches. Lect Notes Comput Sci 4287: 157\u2013171","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"89_CR171","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R Kolisch","year":"2006","unstructured":"Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: An update European. J Oper Res 174(1): 23\u201337","journal-title":"J Oper Res"},{"issue":"14","key":"89_CR172","doi-asserted-by":"crossref","first-page":"1837","DOI":"10.1016\/j.dam.2006.05.012","volume":"155","author":"S Kucherenko","year":"2007","unstructured":"Kucherenko S, Belotti P, Liberti L, Maculan N (2007) New formulations for the Kissing number problem. Discrete Appl Math 155(14): 1837\u20131841","journal-title":"Discrete Appl Math"},{"issue":"9","key":"89_CR173","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1016\/j.cor.2005.10.010","volume":"34","author":"J Kyt\u00f6joki","year":"2007","unstructured":"Kyt\u00f6joki J, Nuortio T, Br\u00e4ysy O, Gendreau M (2007) An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput Oper Res 34(9): 2743\u20132757","journal-title":"Comput Oper Res"},{"issue":"2","key":"89_CR174","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1287\/trsc.1030.0064","volume":"38","author":"SD Lapierre","year":"2004","unstructured":"Lapierre SD, Ruiz AB, Soriano P (2004) Designing distribution networks: Formulations and solution heuristic. Transp Sci 38(2): 174\u2013187","journal-title":"Transp Sci"},{"issue":"2","key":"89_CR175","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/j.ejor.2005.05.021","volume":"175","author":"MA Lejeune","year":"2006","unstructured":"Lejeune MA (2006) A variable neighborhood decomposition search method for supply chain management planning problems. Eur J Oper Res 175(2): 959\u2013976","journal-title":"Eur J Oper Res"},{"issue":"3","key":"89_CR176","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.ress.2006.04.013","volume":"92","author":"Y-C Liang","year":"2007","unstructured":"Liang Y-C, Chen YC (2007) Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm. Reliab Eng Syst Saf 92(3): 323\u2013331","journal-title":"Reliab Eng Syst Saf"},{"issue":"2","key":"89_CR177","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1093\/imaman\/dpm010","volume":"18","author":"Y-C Liang","year":"2007","unstructured":"Liang Y-C, Lo M-H, Chen YC (2007) Variable neighbourhood search for redundancy allocation problems. IMA J Manage Math 18(2): 135\u2013156","journal-title":"IMA J Manage Math"},{"issue":"4","key":"89_CR178","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/j.cie.2007.01.004","volume":"52","author":"CJ Liao","year":"2007","unstructured":"Liao CJ, Cheng CC (2007) A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date. Comput Ind Eng 52(4): 404\u2013413","journal-title":"Comput Ind Eng"},{"issue":"7","key":"89_CR179","doi-asserted-by":"crossref","first-page":"1813","DOI":"10.1080\/00207540600969782","volume":"46","author":"C-J Liao","year":"2008","unstructured":"Liao C-J, Liao C-C (2008) An ant colony optimisation algorithm for scheduling in agile manufacturing. Int J Prod Res 46(7): 1813\u20131824","journal-title":"Int J Prod Res"},{"issue":"10","key":"89_CR180","doi-asserted-by":"crossref","first-page":"3099","DOI":"10.1016\/j.cor.2005.11.017","volume":"34","author":"CJ Liao","year":"2007","unstructured":"Liao CJ, Chao-Tang T, Luarn P (2007) A discrete version of particle swarm optimization for flowshop scheduling problems. Comput Oper Res 34(10): 3099\u20133111","journal-title":"Comput Oper Res"},{"key":"89_CR181","doi-asserted-by":"crossref","unstructured":"Liberti L, Lavor C, Maculan N, Marinelli F (2008) Double variable neighbourhood search with smoothing for the molecular distance geometry problem. J Global Optim. Available online 8 August 2007. doi: 10.1007\/s10898-007-9218-1","DOI":"10.1007\/s10898-007-9218-1"},{"issue":"8","key":"89_CR182","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1057\/palgrave.jors.2602434","volume":"59","author":"S-W Lin","year":"2008","unstructured":"Lin S-W, Ying K-C (2008) A hybrid approach for single-machine tardiness problems with sequence-dependent setup times. J Oper Res Soc 59(8): 1109\u20131119","journal-title":"J Oper Res Soc"},{"issue":"1\u20132","key":"89_CR183","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.cam.2007.08.018","volume":"220","author":"A Ling","year":"2008","unstructured":"Ling A, Xu C, Tang L (2008) A modified VNS metaheuristic for max-bisection problems. J Comput Appl Math 220(1\u20132): 413\u2013421","journal-title":"J Comput Appl Math"},{"issue":"9","key":"89_CR184","first-page":"1309","volume":"13","author":"H Liu","year":"2007","unstructured":"Liu H, Abraham A (2007) An hybrid fuzzy variable neighborhood particle swarm optimization algorithm for solving quadratic assignment problems. J Universal Comput Sci 13(9): 1309\u20131331","journal-title":"J Universal Comput Sci"},{"key":"89_CR185","doi-asserted-by":"crossref","unstructured":"Liu S-C, Chung C-H (2008) A heuristic method for the vehicle routing problem with backhauls and inventory. J Intell Manufact (in press). Published online: 8 April 2008. doi: 10.1007\/s10845-008-0101-9","DOI":"10.1007\/s10845-008-0101-9"},{"key":"89_CR186","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/11903697_26","volume":"4247","author":"HB Liu","year":"2006","unstructured":"Liu HB, Abraham A, Choi O, Moon SH (2006) Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems. Lect Notes Comput Sci 4247: 197\u2013204","journal-title":"Lect Notes Comput Sci"},{"issue":"3","key":"89_CR187","first-page":"316","volume":"29","author":"S-X Liu","year":"2008","unstructured":"Liu S-X, Liu L, Zhang T (2008) Variable neighborhood search for solving vehicle routing problems with backhauls and time windows. J Northeast Univ 29(3): 316\u2013319","journal-title":"J Northeast Univ"},{"key":"89_CR188","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-540-75514-2_12","volume":"4771","author":"I Ljubic","year":"2007","unstructured":"Ljubic I (2007) A hybrid VNS for connected facility location. Lect Notes Comput Sci 4771: 157\u2013169","journal-title":"Lect Notes Comput Sci"},{"issue":"3","key":"89_CR189","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/j.ejor.2006.12.062","volume":"191","author":"S Loudni","year":"2008","unstructured":"Loudni S, Boizumault P (2008) Combining VNS with constraint programming for solving anytime optimization problems. Eur J Oper Res 191(3): 705\u2013735","journal-title":"Eur J Oper Res"},{"issue":"10","key":"89_CR190","doi-asserted-by":"crossref","first-page":"2891","DOI":"10.1016\/j.cor.2005.01.016","volume":"33","author":"S Loudni","year":"2006","unstructured":"Loudni S, Boizumault P, David P (2006) On-line resources allocation for ATM networks with rerouting. Comput Oper Res 33(10): 2891\u20132917","journal-title":"Comput Oper Res"},{"key":"89_CR191","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1057\/palgrave.jors.2602413","volume":"59","author":"A Lusa","year":"2008","unstructured":"Lusa A, Potts CN (2008) A variable neighbourhood search algorithm for the constrained task allocation problem. J Oper Res Soc 59: 812\u2013822","journal-title":"J Oper Res Soc"},{"issue":"5\u20136","key":"89_CR192","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10732-005-3601-1","volume":"11","author":"J Melechovsky","year":"2005","unstructured":"Melechovsky J, Prins C, Calvo R (2005) A metaheuristic to solve a location-routing problem with non-linear costs. J Heuristics 11(5\u20136): 375\u2013391","journal-title":"J Heuristics"},{"key":"89_CR193","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/11890584_7","volume":"4030","author":"B Meli\u00e1n","year":"2006","unstructured":"Meli\u00e1n B (2006) Using memory to improve the VNS metaheuristic for the design of SDH\/WDM networks. Lect Notes Comput Sci 4030: 82\u201393","journal-title":"Lect Notes Comput Sci"},{"issue":"2","key":"89_CR194","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1093\/imaman\/dpm017","volume":"18","author":"B Meli\u00e1n","year":"2007","unstructured":"Meli\u00e1n B, Mladenovi\u0107 N (2007) Editorial. IMA J Manage Math 18(2): 99\u2013100","journal-title":"IMA J Manage Math"},{"key":"89_CR195","unstructured":"Meli\u00e1n-Batista B, H\u00f6ller H, Voss S (2008) Designing WDM networks by a variable neighborhood search. J Telecommun Inform Technol 4\/2006:15\u201320"},{"issue":"3\u20134","key":"89_CR196","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF03179698","volume":"59","author":"L Meric","year":"2004","unstructured":"Meric L, Pesant G, Pierre S (2004) Variable neighborhood search for optical routing in networks using latin routers. Ann Telecommun 59(3\u20134): 261\u2013286","journal-title":"Ann Telecommun"},{"key":"89_CR197","unstructured":"Mladenovi\u0107 N (1995) A variable neighborhood algorithm \u2013 a new metaheuristic for combinatorial optimization. Abstracts of papers presented at Optimization Days, Montr\u00e9al, p 112"},{"key":"89_CR198","unstructured":"Mladenovi\u0107 N (2005) Formulation space search\u2014a new approach to optimization (plenary talk). In: Vuleta J (eds) Proceedings of XXXII SYMOPIS\u201905. Vrnjacka Banja, Serbia, p 3"},{"key":"89_CR199","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, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097\u20131100","journal-title":"Comput Oper Res"},{"key":"89_CR200","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/978-1-4757-4137-7_23","volume":"86","author":"N Mladenovi\u0107","year":"2003","unstructured":"Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2003) Variable neighborhood search for the k-cardinality tree. Appl Optim 86: 481\u2013500","journal-title":"Appl Optim"},{"key":"89_CR201","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/net.10081","volume":"42","author":"N Mladenovi\u0107","year":"2003","unstructured":"Mladenovi\u0107 N, Labb\u00e9 M, Hansen P (2003a) Solving the p-center problem by Tabu search and Variable Neighborhood Search. Networks 42: 48\u201364","journal-title":"Networks"},{"key":"89_CR202","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0377-2217(02)00833-0","volume":"151","author":"N Mladenovi\u0107","year":"2003","unstructured":"Mladenovi\u0107 N, Petrovi\u0107 J, Kova\u010devi\u0107-Vuj\u010di\u0107 V, \u010cangalovi\u0107 M (2003b) Solving spread spectrum radar polyphase code design problem by tabu search and variable neighborhood search. Eur J Oper Res 151: 389\u2013399","journal-title":"Eur J Oper Res"},{"key":"89_CR203","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1016\/j.cor.2004.03.010","volume":"32","author":"N Mladenovi\u0107","year":"2005","unstructured":"Mladenovi\u0107 N, Plastria F, Uro\u0161evi\u0107 D (2005) Reformulation descent applied to circle packing problems. Comput Oper Res 32: 2419\u20132434","journal-title":"Comput Oper Res"},{"issue":"3","key":"89_CR204","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107 N, Brimberg J, Hansen P, Moreno P\u00e9rez JA (2007a) The p-median problem: a survey of metaheuristic approaches. Eur J Oper Res 179(3): 927\u2013939","journal-title":"Eur J Oper Res"},{"key":"89_CR205","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/978-3-540-74446-7_20","volume":"4638","author":"N Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107 N, Plastria F, Uro\u0161evic D (2007b) Formulation space search for circle packing problems. Lect Notes Comput Sci 4638: 212\u2013216","journal-title":"Lect Notes Comput Sci"},{"issue":"3","key":"89_CR206","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1016\/j.ejor.2006.12.064","volume":"191","author":"N Mladenovi\u0107","year":"2008","unstructured":"Mladenovi\u0107 N, Dra\u017ei\u0107 M, Kova\u010devic-Vuj\u010di\u0107 V, \u010cangalovi\u0107 M (2008) General variable neighborhood search for the continuous optimization. Eur J Oper Res 191(3): 753\u2013770","journal-title":"Eur J Oper Res"},{"issue":"3","key":"89_CR207","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10852-008-9087-8","volume":"7","author":"R Montemanni","year":"2008","unstructured":"Montemanni R, Smith DH (2008) Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm. J Math Model Algorithms 7(3): 311\u2013326","journal-title":"J Math Model Algorithms"},{"issue":"2","key":"89_CR208","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0377-2217(02)00831-7","volume":"151","author":"JA Moreno-P\u00e9rez","year":"2003","unstructured":"Moreno-P\u00e9rez JA, Moreno-Vega JM, Rodr\u00edguez-Mart\u00edn I (2003) Variable neighborhood tabu search and its application to the median cycle problem. Eur J Oper Res 151(2): 365\u2013378","journal-title":"Eur J Oper Res"},{"key":"89_CR209","volume-title":"Parallel metaheuristics: a new class of algorithms","author":"JA Moreno-P\u00e9rez","year":"2005","unstructured":"Moreno-P\u00e9rez JA, Hansen P, Mladenovi\u0107 N (2005) Parallel variable neighborhood search. In: Alba E (eds) Parallel metaheuristics: a new class of algorithms. Wiley, New York"},{"issue":"5","key":"89_CR210","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10732-007-9044-0","volume":"14","author":"JM Moreno-Vega","year":"2008","unstructured":"Moreno-Vega JM, Meli\u00e1n B (2008) Introduction to the special issue on variable neighborhood search. J Heuristics 14(5): 403\u2013404","journal-title":"J Heuristics"},{"key":"89_CR211","doi-asserted-by":"crossref","first-page":"4747","DOI":"10.1109\/ISCAS.2005.1465693","volume":"5","author":"H Mori","year":"2005","unstructured":"Mori H, Tsunokawa S (2005) Variable neighborhood tabu search for capacitor placement in distribution systems. IEEE Int Symp Circuits Syst 5: 4747\u20134750","journal-title":"IEEE Int Symp Circuits Syst"},{"key":"89_CR212","doi-asserted-by":"crossref","unstructured":"Naderi B, Zandieh M, Fatemi Ghomi SMT (2008) A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling. J Intell Manufact (in press). Published online: 31 August 2008. doi: 10.1007\/s10845-008-0157-6","DOI":"10.1007\/s10845-008-0157-6"},{"issue":"6","key":"89_CR213","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1016\/j.cor.2004.11.011","volume":"33","author":"M Negreiros","year":"2006","unstructured":"Negreiros M, Palhano A (2006) The capacitated centred clustering problem. Comput Oper Res 33(6): 1639\u20131663","journal-title":"Comput Oper Res"},{"issue":"2","key":"89_CR214","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.eswa.2005.07.009","volume":"30","author":"T Nuortio","year":"2006","unstructured":"Nuortio T, Kyt\u00f6joki J, Niska H, Br\u00e4ysy O (2006) Improved route planning and scheduling of waste collection and transport. Expert Syst Appl 30(2): 223\u2013232","journal-title":"Expert Syst Appl"},{"key":"89_CR215","unstructured":"Ochi LS, Silva MB, Drummond L (2001) Metaheuristics based on GRASP and VNS for solving traveling purchaser problem. MIC\u20192001, pp 489\u2013494, Porto"},{"key":"89_CR216","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/11546245_5","volume":"3636","author":"Z Ognjanovi\u0107","year":"2005","unstructured":"Ognjanovi\u0107 Z, Midi\u0107 S, Mladenovi\u0107 N (2005) A hybrid genetic and variable neighborhood descent for probabilistic SAT problem. Lect Notes Comput Sci 3636: 42\u201353","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"89_CR217","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1057\/palgrave.jors.2602135","volume":"58","author":"IH Osman","year":"2007","unstructured":"Osman IH, Ahmadi S (2007) Guided construction search metaheuristics for the capacitated p-median problem with single source constraint. J Oper Res Soc 58(1): 100\u2013114","journal-title":"J Oper Res Soc"},{"issue":"2","key":"89_CR218","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1093\/imaman\/dpm012","volume":"18","author":"J Pacheco","year":"2007","unstructured":"Pacheco J, Casado S, Nu\u00f1ez L (2007) Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients. IMA J Manage Math 18(2): 191\u2013206","journal-title":"IMA J Manage Math"},{"issue":"1","key":"89_CR219","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/MIS.2008.8","volume":"23","author":"JA Pacheco","year":"2008","unstructured":"Pacheco JA, Casado S, Alegre JF, \u00c1lvarez A (2008) Heuristic solutions for locating health resources. IEEE Intell Syst 23(1): 57\u201363","journal-title":"IEEE Intell Syst"},{"issue":"5","key":"89_CR220","first-page":"967","volume":"13","author":"Q-K Pan","year":"2007","unstructured":"Pan Q-K, Wang W-H, Zhu J-Y (2007a) Some meta-heuristics for no-wait flow shop problem. Comput Integr Manufact Syst, CIMS 13(5): 967\u2013970","journal-title":"Comput Integr Manufact Syst, CIMS"},{"issue":"2","key":"89_CR221","first-page":"323","volume":"13","author":"Q-K Pan","year":"2007","unstructured":"Pan Q-K, Wang W-H, Zhu J-Y, Zhao B-H (2007b) Hybrid heuristics based on particle swarm optimization and variable neighborhood search for job shop scheduling. Comput Integr Manufact Syst, CIMS 13(2): 323\u2013328","journal-title":"Comput Integr Manufact Syst, CIMS"},{"key":"89_CR222","unstructured":"Papadimitriou C (1994) Computational Complexity. Addison Wesley"},{"issue":"5","key":"89_CR223","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10732-007-9045-z","volume":"14","author":"DC Paraskevopoulos","year":"2008","unstructured":"Paraskevopoulos DC, Repoussis PP, Tarantilis CD, Ioannou G, Prastacos GP (2008) A reactive variable neighborhood tabu search for the heterogeneous fleet routing problem with time windows. J Heuristics 14(5): 425\u2013455","journal-title":"J Heuristics"},{"key":"89_CR224","doi-asserted-by":"crossref","unstructured":"Parre\u00f1o F, Alvarez-Valdes R, Oliveira JF, Tamarit JM (2008) Neighborhood structures for the container loading problem: a VNS implementation. J Heuristics (in press). Published online: 24 May 2008. doi: 10.1007\/s10732-008-9081-3","DOI":"10.1007\/s10732-008-9081-3"},{"key":"89_CR225","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1186\/1471-2105-9-161","volume":"9","author":"D Pelta","year":"2008","unstructured":"Pelta D, Gonz\u00e1lez JR, Moreno-Vega JM (2008) A simple and fast heuristic for protein structure comparison. BMC Bioinformatics 9: 161","journal-title":"BMC Bioinformatics"},{"issue":"2","key":"89_CR226","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1093\/imaman\/dpm013","volume":"18","author":"MP P\u00e9rez","year":"2007","unstructured":"P\u00e9rez MP, Rodr\u00edguez FA, Moreno-Vega JM (2007) A hybrid VNS-path relinking for the p-hub median problem. IMA J Manage Math 18(2): 157\u2013172","journal-title":"IMA J Manage Math"},{"key":"89_CR227","unstructured":"Plastria F, Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2005) Variable neighborhood formulation space search for circle packing. 18th Mini Euro Conference VNS, Tenerife, Spain"},{"key":"89_CR228","unstructured":"Plastria F, De Bruyne S, Carrizosa E (2007) Alternating local search based VNS for linear classification. Available at Optimization-online as http:\/\/www.optimization-online.org\/DB_HTML\/2008\/02\/1910.html"},{"issue":"6","key":"89_CR229","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M Polacek","year":"2004","unstructured":"Polacek M, Hartl RF, Doerner K, Reimann M (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heuristics 10(6): 613\u2013627","journal-title":"J Heuristics"},{"issue":"3","key":"89_CR230","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1016\/j.ejor.2005.03.056","volume":"179","author":"M Polacek","year":"2007","unstructured":"Polacek M, Doerner KF, Hartl RF, Kiechle G, Reimann M (2007) Scheduling periodic customer visits for a traveling salesperson. Eur J Oper Res 179(3): 823\u2013837","journal-title":"Eur J Oper Res"},{"issue":"5","key":"89_CR231","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10732-007-9050-2","volume":"14","author":"M Polacek","year":"2008","unstructured":"Polacek M, Doerner KF, Hartl RF, Maniezzo V (2008) A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. J Heuristics 14(5): 405\u2013423","journal-title":"J Heuristics"},{"key":"89_CR232","volume-title":"The logic of scientific discovery","author":"K Popper","year":"1959","unstructured":"Popper K (1959) The logic of scientific discovery. Hutchinson, London"},{"issue":"3","key":"89_CR233","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1016\/j.ejor.2007.04.044","volume":"191","author":"M Prandtstetter","year":"2008","unstructured":"Prandtstetter M, Raidl GR (2008) An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. Eur J Oper Res 191(3): 1004\u20131022","journal-title":"Eur J Oper Res"},{"issue":"5","key":"89_CR234","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10732-007-9048-9","volume":"14","author":"J Puchinger","year":"2008","unstructured":"Puchinger J, Raidl G (2008) Bringing order into the neighborhoods: relaxation guided variable neighborhood search. J Heuristics 14(5): 405\u2013423","journal-title":"J Heuristics"},{"key":"89_CR235","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/11730095_17","volume":"3906","author":"J Puchinger","year":"2006","unstructured":"Puchinger J, Raidl GR, Pferschy U (2006) The core concept for the multidimensional knapsack problem. Lect Notes Comput Sci 3906: 195\u2013208","journal-title":"Lect Notes Comput Sci"},{"key":"89_CR236","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1007\/978-3-540-37258-5_146","volume":"345","author":"B Qian","year":"2006","unstructured":"Qian B, Wang L, Huang DX, Wang X (2006) Multi-objective flow shop scheduling using differential evolution. Lect Notes Control Inform Sci 345: 1125\u20131136","journal-title":"Lect Notes Control Inform Sci"},{"key":"89_CR237","doi-asserted-by":"crossref","unstructured":"Rahimi-Vahed A, Dangchi M, Rafiei H, Salimi E (2008) A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem. Int J Adv Manufact Technol (in press). Published online: 7 June 2008. doi: 10.1007\/s00170-008-1558-6","DOI":"10.1007\/s00170-008-1558-6"},{"key":"89_CR238","volume-title":"Modern heuristic techniques for combinatorial problems","year":"1993","unstructured":"Reeves, CR (eds) (1993) Modern heuristic techniques for combinatorial problems. Blackwell, Oxford, UK"},{"key":"89_CR239","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) TSLIB\u2014a traveling salesman library. ORSA J Comput 3: 376\u2013384","journal-title":"ORSA J Comput"},{"key":"89_CR240","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/978-3-540-71615-0_17","volume":"4446","author":"S Remde","year":"2007","unstructured":"Remde S, Cowling P, Dahal K, Colledge N (2007) Exact\/heuristic hybrids using rVNS and hyperheuristics for workforce scheduling. Lect Notes Comput Sci 4446: 188\u2013197","journal-title":"Lect Notes Comput Sci"},{"key":"89_CR241","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/11890584_10","volume":"4030","author":"PP Repoussis","year":"2006","unstructured":"Repoussis PP, Paraskevopoulos DC, Tarantilis CD, Ioannou G (2006) A reactive greedy randomized variable neighborhood tabu search for the vehicle routing problem with time windows. Lect Notes Comput Sci 4030: 124\u2013138","journal-title":"Lect Notes Comput Sci"},{"key":"89_CR242","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-540-70942-8_29","volume":"4310","author":"PP Repoussis","year":"2007","unstructured":"Repoussis PP, Tarantilis CD, Ioannouo G (2007) A hybrid metaheuristic for a real life vehicle routing problem. Lect Notes Comput Sci 4310: 247\u2013254","journal-title":"Lect Notes Comput Sci"},{"issue":"1\u20132","key":"89_CR243","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(01)00255-4","volume":"118","author":"CC Ribeiro","year":"2002","unstructured":"Ribeiro CC, de Souza MC (2002) Variable neighborhood search for the degree-constrained minimum spanning tree problem. Discrete Appl Math 118(1\u20132): 43\u201354","journal-title":"Discrete Appl Math"},{"issue":"3","key":"89_CR244","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1111\/j.1475-3995.2005.498_1.x","volume":"12","author":"CC Ribeiro","year":"2005","unstructured":"Ribeiro CC, Vianna DS (2005) A GRASP\/VND heuristic for the phylogeny problem using a new neighborhood structure. Int Trans Oper Res 12(3): 325\u2013338","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"89_CR245","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"CC Ribeiro","year":"2002","unstructured":"Ribeiro CC, Uchoa E, Werneck R (2002) A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J Comput 14(3): 228\u2013246","journal-title":"INFORMS J Comput"},{"issue":"4","key":"89_CR246","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1016\/j.comcom.2006.08.027","volume":"30","author":"CC Ribeiro","year":"2007","unstructured":"Ribeiro CC, Martins SL, Rosseti I (2007) Metaheuristics for optimization problems in computer communications. Comput Commun 30(4): 656\u2013669","journal-title":"Comput Commun"},{"issue":"3","key":"89_CR247","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1016\/j.ejor.2007.04.034","volume":"191","author":"CC Ribeiro","year":"2008","unstructured":"Ribeiro CC, Aloise D, Noronha TF, Rocha C, Urrutia S (2008a) A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints. Eur J Oper Res 191(3): 981\u2013992","journal-title":"Eur J Oper Res"},{"issue":"3","key":"89_CR248","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1016\/j.ejor.2007.02.003","volume":"191","author":"CC Ribeiro","year":"2008","unstructured":"Ribeiro CC, Aloise D, Noronha TF, Rocha C, Urrutia S (2008b) An efficient implementation of a VNS\/ILS heuristic for a real-life car sequencing problem. Eur J Oper Res 191(3): 596\u2013611","journal-title":"Eur J Oper Res"},{"issue":"1","key":"89_CR249","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1013661617536","volume":"8","author":"LM Rousseau","year":"2002","unstructured":"Rousseau LM, Gendreau M, Pesant G (2002) Using constraint-based operators to solve the vehicle routing problem with time windows. J Heuristics 8(1): 43\u201358","journal-title":"J Heuristics"},{"issue":"5","key":"89_CR250","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/s10732-007-9049-8","volume":"14","author":"R Santana","year":"2008","unstructured":"Santana R, Larra\u00f1aga P, Lozano JA (2008) Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem. J Heuristics 14(5): 519\u2013547","journal-title":"J Heuristics"},{"key":"89_CR251","doi-asserted-by":"crossref","unstructured":"Schmid V, Doerner KF, Hartl RF, Salazar-Gonz\u00e1lez JJ (2008) Hybridization of very large neighborhood search for ready-mixed concrete delivery problems Comput Oper Res (in press). Published online: 3 August 2008. doi: 10.1016\/j.cor.2008.07.010","DOI":"10.1016\/j.cor.2008.07.010"},{"key":"89_CR252","unstructured":"Sedlar J, Vukicevic D, Aouchiche M, Hansen P (2007a) Variable neighborhood search for extremal graphs 24. Conjectures and results about the clique number Les Cahiers du GERAD G-2007-33"},{"key":"89_CR253","unstructured":"Sedlar J, Vukicevic D, Aouchiche M, Hansen P (2007b) Variable neighborhood search for extremal graphs 25. Products of connectivity and distance measures Les Cahiers du GERAD G-2007-47"},{"key":"89_CR254","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/11730095_22","volume":"3906","author":"M Sevkli","year":"2006","unstructured":"Sevkli M, Aydin ME (2006a) A variable neighbourhood search algorithm for job shop scheduling problems. Lect Notes Comput Sci 3906: 261\u2013271","journal-title":"Lect Notes Comput Sci"},{"issue":"2","key":"89_CR255","doi-asserted-by":"crossref","first-page":"34","DOI":"10.4304\/jsw.1.2.34-39","volume":"1","author":"M Sevkli","year":"2006","unstructured":"Sevkli M, Aydin ME (2006b) Variable Neighbourhood Search for job shop scheduling problems. J Softw 1(2): 34\u201339","journal-title":"J Softw"},{"issue":"2","key":"89_CR256","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1093\/imaman\/dpm009","volume":"18","author":"M Sevkli","year":"2007","unstructured":"Sevkli M, Aydin ME (2007) Parallel variable neighbourhood search algorithms for job shop scheduling problems. IMA J Manage Math 18(2): 117\u2013134","journal-title":"IMA J Manage Math"},{"key":"89_CR257","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/11902140_16","volume":"4263","author":"Z Sevkli","year":"2006","unstructured":"Sevkli Z, Sevilgen FE (2006) Variable neighborhood search for the orienteering problem. Lect Notes Comput Sci 4263: 134\u2013143","journal-title":"Lect Notes Comput Sci"},{"key":"89_CR258","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/978-3-540-78761-7_64","volume":"4974","author":"Z Sevkli","year":"2008","unstructured":"Sevkli Z, Sevilgen FE (2008) A hybrid particle swarm optimization algorithm for function optimization. Lect Notes Comput Sci 4974: 585\u2013595","journal-title":"Lect Notes Comput Sci"},{"issue":"8\u20139","key":"89_CR259","doi-asserted-by":"crossref","first-page":"1854","DOI":"10.1016\/j.laa.2007.10.024","volume":"428","author":"D Stevanovic","year":"2008","unstructured":"Stevanovic D, Aouchiche M, Hansen P (2008) On the spectral radius of graphs with a given domination number. Linear Algebra Appl 428(8\u20139): 1854\u20131864","journal-title":"Linear Algebra Appl"},{"key":"89_CR260","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-540-78604-7_12","volume":"4972","author":"A Subramanian","year":"2008","unstructured":"Subramanian A, Dos Anjos Formiga Cabral L (2008) An ILS based heuristic for the vehicle routing problem with simultaneous pickup and delivery and time limit. Lect Notes Comput Sci 4972: 135\u2013146","journal-title":"Lect Notes Comput Sci"},{"issue":"3","key":"89_CR261","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/eej.20469","volume":"158","author":"K Tagawa","year":"2007","unstructured":"Tagawa K, Ohtani T, Igaki T, Seki S, Inoue K (2007) Robust optimum design of SAW filters by the penalty function method. Electrical Eng Jpn 158(3): 45\u201354","journal-title":"Electrical Eng Jpn"},{"key":"89_CR262","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/978-3-540-28646-2_38","volume":"3172","author":"MF Tasgetiren","year":"2004","unstructured":"Tasgetiren MF, Sevkli M, Liang Y-C, Gencyilmaz G (2004) Particle swarm optimization algorithm for permutation flowshop sequencing problem. Lect Notes Comput Sci 3172: 382\u2013389","journal-title":"Lect Notes Comput Sci"},{"issue":"3","key":"89_CR263","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177(3): 1930\u20131947","journal-title":"Eur J Oper Res"},{"issue":"2","key":"89_CR264","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1016\/j.jmaa.2006.06.025","volume":"328","author":"AD Toksari","year":"2007","unstructured":"Toksari AD, G\u00fcner E (2007) Solving the unconstrained optimization problem by a variable neighborhood search. J Math Anal Appl 328(2): 1178\u20131187","journal-title":"J Math Anal Appl"},{"key":"89_CR265","doi-asserted-by":"crossref","unstructured":"Tseng C-T, Liao C-J, Huang K-L (2008) Minimizing total tardiness on a single machine with controllable processing times. Comput Oper Res (in press). Published online: 27 May 2008. doi: 10.1016\/j.cor.2008.05.009","DOI":"10.1016\/j.cor.2008.05.009"},{"issue":"8","key":"89_CR266","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1016\/S0305-0548(03)00073-X","volume":"31","author":"D Uro\u0161evi\u0107","year":"2004","unstructured":"Uro\u0161evi\u0107 D, Brimberg J, Mladenovi\u0107 N (2004) Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Comput Oper Res 31(8): 1205\u20131213","journal-title":"Comput Oper Res"},{"key":"89_CR267","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/11730095_24","volume":"3906","author":"G Villa","year":"2006","unstructured":"Villa G, Lozano S, Racero J, Canca D (2006) A hybrid VNS\/Tabu search algorithm for apportioning the European Parliament. Lect Notes Comput Sci 3906: 284\u2013292","journal-title":"Lect Notes Comput Sci"},{"key":"89_CR268","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1057\/palgrave.jors.2602165","volume":"58","author":"L Vogt","year":"2007","unstructured":"Vogt L, Poojari CA, Beasley JE (2007) A tabu search algorithm for the single vehicle routing allocation problem. J Oper Res Soc 58: 467\u2013480","journal-title":"J Oper Res Soc"},{"key":"89_CR269","doi-asserted-by":"crossref","unstructured":"Wang X, Tang L (2008) A population-based variable neighborhood search for the single machine total weighted tardiness problem. Comput Oper Res (in press). Published online: 31 July 2008. doi: 10.1016\/j.cor.2008.07.009","DOI":"10.1016\/j.cor.2008.07.009"},{"key":"89_CR270","first-page":"95","volume":"21","author":"R Whitaker","year":"1983","unstructured":"Whitaker R (1983) A fast algorithm for the greedy interchange of large-scale clustering and median location problems. INFOR 21: 95\u2013108","journal-title":"INFOR"},{"issue":"4","key":"89_CR271","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s00291-007-0114-3","volume":"30","author":"J Wollenweber","year":"2008","unstructured":"Wollenweber J (2008) A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application. OR Spectrum 30(4): 655\u2013673","journal-title":"OR Spectrum"},{"key":"89_CR272","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/978-3-540-73297-6_11","volume":"75","author":"F Xhafa","year":"2007","unstructured":"Xhafa F (2007) A hybrid evolutionary heuristic for job scheduling on computational grids. Stud Comput Intell 75: 269\u2013311","journal-title":"Stud Comput Intell"},{"key":"89_CR273","doi-asserted-by":"crossref","unstructured":"Yang J, Zhang J, Aydin ME, Wu JY (2007) A novel programming model and optimisation algorithms for WCDMA networks. IEEE Vehicular Technology Conference, pp 1182\u20131187","DOI":"10.1109\/VETECS.2007.250"},{"issue":"4","key":"89_CR274","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1061\/(ASCE)0733-947X(2006)132:4(303)","volume":"132","author":"V Yepes","year":"2006","unstructured":"Yepes V, Medina J (2006) Economic heuristic optimization for heterogeneous fleet VRPHESTW. J Transp Eng 132(4): 303\u2013311","journal-title":"J Transp Eng"},{"key":"89_CR275","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/11554028_12","volume":"3684","author":"C Zhang","year":"2005","unstructured":"Zhang C, Lin Z, Lin Z (2005) Variable neighborhood search with permutation distance for QAP. Lect Notes Comput Sci 3684: 81\u201388","journal-title":"Lect Notes Comput Sci"},{"issue":"3","key":"89_CR276","first-page":"627","volume":"191","author":"QH Zhao","year":"2008","unstructured":"Zhao QH, Chen S, Zang CY (2008) Model and algorithm for inventory\/routing decision in a three-echelon logistics system. Eur J Oper Res 191(3): 627\u2013635","journal-title":"Eur J Oper Res"},{"key":"89_CR277","doi-asserted-by":"crossref","unstructured":"Zobolas GI, Tarantilis CD, Ioannou G (2008) Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Comput Oper Res. Available online 8 February 2008. doi: 10.1016\/j.cor.2008.01.007","DOI":"10.1016\/j.cor.2008.01.007"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-008-0089-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-008-0089-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-008-0089-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T22:52:57Z","timestamp":1684623177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-008-0089-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,8]]},"references-count":277,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["89"],"URL":"https:\/\/doi.org\/10.1007\/s10288-008-0089-1","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,8]]}}}