{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:06:23Z","timestamp":1725516383402},"publisher-location":"Berlin, Heidelberg","reference-count":59,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540782940"},{"type":"electronic","value":"9783540782957"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78295-7_5","type":"book-chapter","created":{"date-parts":[[2008,8,11]],"date-time":"2008-08-11T09:20:59Z","timestamp":1218446459000},"page":"117-150","source":"Crossref","is-referenced-by-count":11,"title":["Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems"],"prefix":"10.1007","author":[{"given":"Marco","family":"Chiarandini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irina","family":"Dumitrescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"volume-title":"Local Search in Combinatorial Optimization","year":"1997","unstructured":"E. H. L. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, Chichester, UK, 1997.","key":"5_CR1_1"},{"issue":"1\u20133","key":"5_CR2_1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"R. K. Ahuja, O. Ergun, J. B. Orlin, and A. P. Punnen. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123(1\u20133): 75\u2013102, 2002.","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR3_1","first-page":"20","volume-title":"Handbook of Approximation Algorithms and Metaheuristics","author":"RK Ahuja","year":"2007","unstructured":"R. K. Ahuja, \u00d6. Ergun, J. B. Orlin, and A. P. Punnen. Very large-scale neighborhood search: Theory, algorithms, and applications. In T. F. Gonzalez, editor, Handbook of Approximation Algorithms and Metaheuristics, pages 20\u20131\u201320\u201315. Chapman & Hall\/CRC, Boca Raton, FL, USA, 2007."},{"issue":"41\u20135","key":"5_CR4_1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1475-3995.2000.tb00201.x","volume":"7","author":"RK Ahuja","year":"2000","unstructured":"R. K. Ahuja, J. B. Orlin, and D. Sharma. Very large-scale neighbourhood search. International Transactions in Operational Research, 7(4\u20135):301\u2013317, 2000.","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"5_CR5_1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"RK Ahuja","year":"2001","unstructured":"R. K. Ahuja, J. B. Orlin, and D. Sharma. Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem. Mathematical Programming, 91(1):71\u201397, 2001. Series A.","journal-title":"Mathematical Programming"},{"key":"5_CR6_1","first-page":"100","volume-title":"Proceedings of the Computational Symposium on Graph Coloring and its Generalizations","author":"M Allen","year":"2002","unstructured":"M. Allen, G. Kumaran, and T. Liu. A combined algorithm for graph-coloring in register allocation. In D. S. Johnson, A. Mehrotra, and M. Trick, editors, Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pages 100\u2013111, Ithaca, New York, USA, 2002."},{"key":"5_CR7_1","volume-title":"Finding tours in the TSP","author":"D Applegate","year":"1999","unstructured":"D. Applegate, R. Bixby, V. Chv\u00e1tal, and W. Cook. Finding tours in the TSP. Technical Report 99885, Forschungsinstitut f\u00fcr Diskrete Mathematik, University of Bonn, Germany, 1999."},{"issue":"2","key":"5_CR8_1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00832-9","volume":"151","author":"C Avanthay","year":"2003","unstructured":"C. Avanthay, A. Hertz, and N. Zufferey. A variable neighborhood search for graph coloring. European Journal of Operational Research, 151(2):379\u2013388, 2003.","journal-title":"European Journal of Operational Research"},{"key":"5_CR9_1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/B:ANOR.0000032574.01332.98","volume":"130","author":"N Barnier","year":"2004","unstructured":"N. Barnier and P. Brisset. Graph coloring for air traffic flow management. Annals of Operation Research, 130:163\u2013178, 2004.","journal-title":"Annals of Operation Research"},{"key":"5_CR10_1","volume-title":"The race package for R. Racing methods for the selection of the best","author":"M Birattari","year":"2003","unstructured":"M. Birattari. The race package for R. Racing methods for the selection of the best. Technical Report TR\/IRIDIA\/2003-37, IRIDIA, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium, 2003."},{"key":"5_CR11_1","first-page":"11","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002)","author":"M Birattari","year":"2002","unstructured":"M. Birattari, T. St\u00fctzle, L. Paquete, and K. Varrentrapp. A racing algorithm for configuring metaheuristics. In W. B. Langdon et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002), pages 11\u201318. Morgan Kaufmann Publishers, San Francisco, CA, USA, 2002."},{"issue":"4","key":"5_CR12_1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"D. Br\u00e9laz. New methods to color the vertices of a graph. Communications of the ACM, 22(4):251\u2013256, 1979.","journal-title":"Communications of the ACM"},{"key":"5_CR13_1","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s00291-006-0052-5","volume":"29","author":"T Brueggemann","year":"2007","unstructured":"T. Brueggemann and J. L. Hurink. Two very large-scale neighborhoods for single machine scheduling. OR Spektrum, 29:513\u2013533, 2007.","journal-title":"OR Spektrum"},{"key":"5_CR14_1","volume-title":"Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems","author":"M Chiarandini","year":"2005","unstructured":"M. Chiarandini. Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems. PhD thesis, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany, August 2005."},{"key":"5_CR15_1","first-page":"189","volume-title":"MIC2005: The Sixth Metaheuristics International Conference","author":"M Chiarandini","year":"2005","unstructured":"M. Chiarandini, D. Basso, and T. St\u00fctzle. Statistical methods for the comparison of stochastic optimizers. In K. F. Doerner, M. Gendreau, P. Greistorfer, W. J. Gutjahr, R. F. Hartl, and M. Reimann, editors, MIC2005: The Sixth Metaheuristics International Conference, pages 189\u2013196, Vienna, Austria, August 2005."},{"key":"5_CR16_1","first-page":"63\u20131","volume-title":"Handbook of Approximation Algorithms and Metaheuristics","author":"M Chiarandini","year":"2007","unstructured":"M. Chiarandini, I. Dumitrescu, and T. St\u00fctzle. Stochastic local search algorithms for the graph coloring problem. In T. F. Gonzalez, editor, Handbook of Approximation Algorithms and Metaheuristics, pages 63\u20131\u201363\u201317. Chapman & Hall\/CRC, Boca Raton, FL, USA, 2007."},{"key":"5_CR17_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/11890584_13","volume-title":"Hybrid Metaheuristics","author":"M Chiarandini","year":"2006","unstructured":"M. Chiarandini, T. St\u00fctzle, and K. S. Larsen. Colour reassignment in tabu search for the graph set t-colouring problem. In F. Almeida, M. Blesa, C. Blum, J. M. Moreno, M. P\u00e9rez, A. Roli, and M. Sampels, editors, Hybrid Metaheuristics, volume 4030 of Lecture Notes in Computer Science, pages 162\u2013177. Springer-Verlag, Berlin, Germany, 2006."},{"unstructured":"R. K. Congram. Polynomially Searchable Exponential Neighbourhoods for Sequencing Problems in Combinatorial Optimization. PhD thesis, Southampton University, Faculty of Mathematical Studies, Southampton, UK, 2000.","key":"5_CR18_1"},{"issue":"1","key":"5_CR19_1","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"RK Congram","year":"2002","unstructured":"R. K. Congram, C. N. Potts, and S. van de Velde. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14(1):52\u201367, 2002.","journal-title":"INFORMS Journal on Computing"},{"key":"5_CR20_1","volume-title":"Practical Nonparametric Statistics","author":"WJ Conover","year":"1999","unstructured":"W. J. Conover. Practical Nonparametric Statistics. John Wiley & Sons, New York, NY, USA, third edition, 1999.","edition":"3"},{"issue":"2","key":"5_CR21_1","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D Werra de","year":"1985","unstructured":"D. de Werra. An introduction to timetabling. European Journal of Operational Research, 19(2):151\u2013162, 1985.","journal-title":"European Journal of Operational Research"},{"key":"5_CR22_1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-1-4615-5775-3_6","volume-title":"Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"R Dorne","year":"1999","unstructured":"R. Dorne and J. K. Hao. Tabu search for graph coloring, T-colorings and set T-colorings. In S. Vo\u00df, S. Martello, I. H. Osman, and C. Roucairol, editors, Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 77\u201392. Kluwer Academic Publishers, Boston, MA, USA, 1999."},{"key":"5_CR23_1","volume-title":"Constrained path and cycle problems","author":"I Dumitrescu","year":"2002","unstructured":"I. Dumitrescu. Constrained path and cycle problems. PhD thesis, The University of Melbourne, Melbourne, Australia, 2002."},{"key":"5_CR24_1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"M. Fischetti and A. Lodi. Local branching. Mathematical Programming, 98:23\u201347, 2003.","journal-title":"Mathematical Programming"},{"key":"5_CR25_1","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C Fleurent","year":"1996","unstructured":"C. Fleurent and J. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63:437\u2013464, 1996.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"5_CR26_1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P Galinier","year":"1999","unstructured":"P. Galinier and J. Hao. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3(4):379\u2013397, 1999.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"5_CR27_1","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","volume":"35","author":"A Gamst","year":"1986","unstructured":"A. Gamst. Some lower bounds for a class of frequency assignment problems. IEEE Transactions of Vehicular Technology, 35(1):8\u201314, 1986.","journal-title":"IEEE Transactions of Vehicular Technology"},{"issue":"2","key":"5_CR28_1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10878-006-9019-3","volume":"13","author":"B Gendron","year":"2007","unstructured":"B. Gendron, A. Hertz, and P. St-Louis. On edge orienting methods for graph coloring. Journal of Combinatorial Optimization, 13(2):163\u2013178, 2007.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"5_CR29_1","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1057\/palgrave.jors.2601815","volume":"56","author":"CA Glass","year":"2005","unstructured":"C. A. Glass and Adam Pr\u00fcgel-Bennett. A polynomially searchable exponential neighbourhood for graph colouring. Journal of the Operational Research Society, 56(3):324\u2013330, 2005.","journal-title":"Journal of the Operational Research Society"},{"issue":"1\u20133","key":"5_CR30_1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F Glover","year":"1996","unstructured":"F. Glover. Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics, 65(1\u20133):223\u2013253, 1996.","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR31_1","first-page":"1","volume-title":"Interfaces in Computer Science and Operations Research: Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies","author":"F Glover","year":"1996","unstructured":"F. Glover. Tabu search and adaptive memory programming \u2013 advances, applications and challenges. In R. S. Barr, R. V. Helgason, and J. L. Kennington, editors, Interfaces in Computer Science and Operations Research: Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies, pages 1\u201375. Kluwer Academic Publishers, Boston, MA, USA, 1996."},{"issue":"1\u20134","key":"5_CR32_1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1021573507189","volume":"117","author":"JL Gonz\u00e1lez-Velarde","year":"2002","unstructured":"J. L. Gonz\u00e1lez-Velarde and M. Laguna. Tabu search with simple ejection chains for coloring graphs. Annals of Operations Research, 117(1\u20134):165\u2013174, 2002.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"5_CR33_1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0167-6377(03)00064-6","volume":"32","author":"A Grosso","year":"2004","unstructured":"A. Grosso, F. Della Croce, and R. Tadei. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Operations Research Letters, 32(1):68\u201372, 2004.","journal-title":"Operations Research Letters"},{"issue":"4","key":"5_CR34_1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0305-0548(98)00065-3","volume":"26","author":"G Gutin","year":"1999","unstructured":"G. Gutin and A. Yeo. Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. Computers & OR, 26(4):321\u2013327, 1999.","journal-title":"Computers & OR"},{"issue":"12","key":"5_CR35_1","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"W. K. Hale. Frequency assignment: Theory and applications. Proceedings of the IEEE, 68(12):1497\u20131514, 1980.","journal-title":"Proceedings of the IEEE"},{"issue":"4","key":"5_CR36_1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A Hertz","year":"1987","unstructured":"A. Hertz and D. de Werra. Using tabu search techniques for graph coloring. Computing, 39(4):345\u2013351, 1987.","journal-title":"Computing"},{"key":"5_CR37_1","volume-title":"Stochastic Local Search: Foundations and Applications","author":"HH Hoos","year":"2004","unstructured":"H. H. Hoos and T. St\u00fctzle. Stochastic Local Search: Foundations and Applications. Morgan Kaufmann Publishers, San Francisco, CA, USA, 2004."},{"key":"5_CR38_1","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032497","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1994","unstructured":"T. R. Jensen and B. Toft. Graph Coloring Problems. John Wiley & Sons, New York, NY, USA, 1994."},{"key":"5_CR39_1","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"DS Johnson","year":"1997","unstructured":"D. S. Johnson and L. A. McGeoch. The traveling salesman problem: A case study in local optimization. In E. H. L. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 215\u2013310. John Wiley & Sons, Chichester, UK, 1997."},{"key":"5_CR40_1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85\u2013103. Plenum Press, New York, USA, 1972."},{"key":"5_CR41_1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell Systems Technology Journal, 49:213\u2013219, 1970.","journal-title":"Bell Systems Technology Journal"},{"unstructured":"D. E. Knuth. The Art of Computer Programming, Volume 4, Fascicle 3 \u2013 Generating All Combinations and Partitions. Addison Wesley, third edition, 2005.","key":"5_CR42_1"},{"issue":"6","key":"5_CR43_1","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"FT Leighton","year":"1979","unstructured":"F. T. Leighton. A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards, 84(6):489\u2013506, 1979.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"5_CR44_1","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1145\/1066677.1066892","volume-title":"SAC\u201905: Proceedings of the 2005 ACM Symposium on Applied Computing","author":"A Lim","year":"2005","unstructured":"A. Lim, Y. Zhu, Q. Lou, and B. Rodrigues. Heuristic methods for graph coloring problems. In SAC\u201905: Proceedings of the 2005 ACM Symposium on Applied Computing, pages 933\u2013939, New York, NY, USA, 2005. ACM Press."},{"issue":"2","key":"5_CR45_1","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21(2):498\u2013516, 1973.","journal-title":"Operations Research"},{"key":"5_CR46_1","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"HR Louren\u00e7o","year":"2002","unstructured":"H. R. Louren\u00e7o, O. Martin, and T. St\u00fctzle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 321\u2013353. Kluwer Academic Publishers, Norwell, MA, USA, 2002."},{"issue":"2","key":"5_CR47_1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1017912624016","volume":"8","author":"P Merz","year":"2002","unstructured":"P. Merz and B. Freisleben. Greedy and local search heuristics for the unconstrained binary quadratic programming problem. Journal of Heuristics, 8(2):197\u2013213, 2002.","journal-title":"Journal of Heuristics"},{"key":"5_CR48_1","volume-title":"Efficient Cluster Compensation for Lin-Kernighan Heuristics","author":"D Neto","year":"1999","unstructured":"D. Neto. Efficient Cluster Compensation for Lin-Kernighan Heuristics. PhD thesis, University of Toronto, Department of Computer Science, Toronto, Canada, 1999."},{"key":"5_CR49_1","volume-title":"Dynasearch: Iterative local improvement by dynamic programming; part I, the traveling salesman problem","author":"CN Potts","year":"1995","unstructured":"C. N. Potts and S. van de Velde. Dynasearch: Iterative local improvement by dynamic programming; part I, the traveling salesman problem. Technical Report LPOM\u20139511, Faculty of Mechanical Engineering, University of Twente, Enschede, The Netherlands, 1995."},{"issue":"2\u20133","key":"5_CR50_1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"FS Roberts","year":"1991","unstructured":"F. S. Roberts. T-colorings of graphs: Recent results and open problems. Discrete Mathematics, 93(2-3):229\u2013245, 1991.","journal-title":"Discrete Mathematics"},{"key":"5_CR51_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Proceedings of Principles and Practice of Constraint Programming","author":"P Shaw","year":"1998","unstructured":"P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In M. J. Maher and J.-F. Puget, editors, Proceedings of Principles and Practice of Constraint Programming, volume 1520 of Lecture Notes in Computer Science, pages 417\u2013431. Springer-Verlag, Berlin, Germany, 1998."},{"key":"5_CR52_1","first-page":"229","volume":"77","author":"BA Tesman","year":"1990","unstructured":"B. A. Tesman. Set T-colorings. Congressus Numerantium, 77:229\u2013242, 1990.","journal-title":"Congressus Numerantium"},{"unstructured":"P. M. Thompson and J. B. Orlin. The theory of cycle transfers. Working Paper No. OR 200-89, 1989.","key":"5_CR53_1"},{"key":"5_CR54_1","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"PM Thompson","year":"1993","unstructured":"P. M. Thompson and H. N. Psaraftis. Cyclic transfer algorithm for multivehicle routing and scheduling problems. Operations Research, 41:935\u2013946, 1993.","journal-title":"Operations Research"},{"key":"5_CR55_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-72397-4_25","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"MA Trick","year":"2007","unstructured":"M. A. Trick and H. Yildiz. A large neighborhood search heuristic for graph coloring. In P. Van Hentenryck and L. Wolsey, editors, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 4510 of Lecture Notes in Computer Science, pages 346\u2013360. Springer-Verlag, Berlin, Germany, 2007."},{"issue":"3","key":"5_CR56_1","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s101070050010","volume":"87","author":"GJ Woeginger","year":"2000","unstructured":"G. J. Woeginger V. G. Deineko. A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. Mathematical Programming, 87(3):519\u2013542, 2000.","journal-title":"Mathematical Programming"},{"issue":"5","key":"5_CR57_1","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1023\/A:1011306011437","volume":"7","author":"M Yagiura","year":"2001","unstructured":"M. Yagiura and T. Ibaraki. Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: Experimental evaluation. Journal of Heuristics, 7(5):423\u2013442, 2001.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"5_CR58_1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.1030.0036","volume":"16","author":"M Yagiura","year":"2004","unstructured":"M. Yagiura, T. Ibaraki, and F. Glover. An ejection chain approach for the generalized assignment problem. INFORMS Journal on Computing, 16(2):133\u2013151, 2004.","journal-title":"INFORMS Journal on Computing"},{"unstructured":"A. Zymolka, A. M. C. A. Koster, and R. Wess\u00e4ly. Transparent optical network design with sparse wavelength conversion. In Proceedings of the 7th IFIP Working Conference on Optical Network Design & Modelling, pages 61\u201380, Budapest, Hungary, 2003.","key":"5_CR59_1"}],"container-title":["Studies in Computational Intelligence","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78295-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:36Z","timestamp":1619507076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78295-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540782940","9783540782957"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78295-7_5","relation":{},"ISSN":["1860-949X"],"issn-type":[{"type":"print","value":"1860-949X"}],"subject":[],"published":{"date-parts":[[2008]]}}}