{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:20:27Z","timestamp":1758824427971,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":26,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781441913050"},{"type":"electronic","value":"9781441913067"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-1-4419-1306-7_10","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T18:32:39Z","timestamp":1252953159000},"page":"245-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Variable Intensity Local Search"],"prefix":"10.1007","author":[{"given":"Sne\u017eana","family":"Mitrovi\u0107-Mini\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"23","author":"R.K. Ahuja","year":"2002","unstructured":"R.K. Ahuja, O. Ergun, and A. Punnen. A survey of very large scale neighborhood search techniques. Discrete Applied Mathematics, 23:75\u2013102, 2002.","journal-title":"Discrete Applied Mathematics"},{"unstructured":"R.K. Ahuja, O. Ergun, and A. Punnen. Very large scale neighborhood search: Theory, algorithms, and applications. In T. Gonzalez, editor, Handbook of Approximation Algorithms and Metaheuristics, volume 10 of Computer and Information Science Series. Chapmann and Hall, CRC Press, 2007.","key":"10_CR2"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","volume":"33","author":"R. Bent","year":"2006","unstructured":"R. Bent and P. V. Hentenryck. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research, 33:875\u2013893, 2006.","journal-title":"Computers & Operations Research"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","volume":"60","author":"D. Cattrysse","year":"1992","unstructured":"D. Cattrysse and L.N. Van Wassenhove. A survey of algorithms for the generalized assignment problem. European Journal of Operational Research, 60:260\u2013272, 1992.","journal-title":"European Journal of Operational Research"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"E. Danna, E. Rothberg, and C. Le Pape. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming, 102:71\u201390, 2005.","journal-title":"Mathematical Programming"},{"key":"10_CR6","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":"10_CR7","volume-title":"Management of Distributed Data Processing","author":"B. Gavish","year":"1982","unstructured":"B. Gavish and H. Pirkul. Allocation of databases and processors in a distributed computing system. In J. Akoka, editor, Management of Distributed Data Processing. North-Holland Publishing Company, Amsterdam, 1982."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TC.1986.1676799","volume":"35","author":"B. Gavish","year":"1986","unstructured":"B. Gavish and H. Pirkul. Computer and database location in distributed computer systems. IEEE Transactions in Computing, 35:583\u2013590, 1986.","journal-title":"IEEE Transactions in Computing"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1287\/mnsc.37.6.695","volume":"37","author":"B. Gavish","year":"1991","unstructured":"B. Gavish and H. Pirkul. Algorithms for the multi-resource generalized assignment problem. Management Science, 37:695\u2013713, 1991.","journal-title":"Management Science"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/B978-0-08-040806-4.50037-X","volume-title":"Computer Science and Operations Research: New Development in Their Interfaces","author":"F. Glover","year":"1992","unstructured":"F. Glover. New ejection chain and alternating path methods for traveling salesman problem. In O. Balci, R. Sharda, and S. Zenios, editors, Computer Science and Operations Research: New Development in Their Interfaces, pages 491\u2013507. Pergamon, Oxford, 1992."},{"key":"10_CR11","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:498\u2013516, 1973.","journal-title":"Operations Research"},{"key":"10_CR12","volume-title":"Adaptive approach heuristic for the generalized assignment problem","author":"H.R. Louren\u00e7o","year":"1998","unstructured":"H.R. Louren\u00e7o and D. Serra. Adaptive approach heuristic for the generalized assignment problem. Technical report, Department of Economics and Management, Universitat Pompeu Fabra, R. Trias Fargas 25-27, 08005 Barcelona, Spain, 1998."},{"unstructured":"S. Martello and P. Toth. An algorithm for the generalized assignment problem. In J.P. Brans, editor, Operational Research\u201981, pages 589\u2013603. North-Holland, 1981.","key":"10_CR13"},{"unstructured":"S. Mitrovic-Minic and A.P. Punnen. Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem. Submitted for publication.","key":"10_CR14"},{"issue":"5","key":"10_CR15","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1080\/09720502.2008.10700590","volume":"11","author":"S. Mitrovic-Minic","year":"2008","unstructured":"S. Mitrovic-Minic and A.P. Punnen. Very large-scale variable neighborhood search for the generalized assignment problem. Journal of Interdisciplinary Mathematics, 11(5):653\u2013670, 2008.","journal-title":"Journal of Interdisciplinary Mathematics"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"N. Mladenovi\u0107 and P. Hansen. Variable neighborhood search. Computers & Operations Research, 24:1097\u20131100, 1997.","journal-title":"Computers & Operations Research"},{"key":"10_CR17","volume-title":"A private fleet model with multi-stop backhaul","author":"R.A. Murphy","year":"1986","unstructured":"R.A. Murphy. A private fleet model with multi-stop backhaul. Working paper 103, Optimal Decision Systems, Green Bay, WI54306, 1986."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1057\/palgrave.jors.2602356","volume":"59","author":"T. Oncan","year":"2008","unstructured":"T. Oncan, S.N. Kabadi, K.P.N. Nair, and A.P. Punnen. VLSN search algorithms for partitioning problems using matching neighbourhoods. The Journal of the Operational Research Society, 59:388\u2013398, 2008.","journal-title":"The Journal of the Operational Research Society"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01720977","volume":"17","author":"I.H. Osman","year":"1995","unstructured":"I.H. Osman. Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches. OR Spektrum, 17:211\u2013225, 1995.","journal-title":"OR Spektrum"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/0377-2217(86)90142-6","volume":"26","author":"H. Pirkul","year":"1986","unstructured":"H. Pirkul. An integer programming model for allocation of databases in a distributed computer system. European Journal of Operational Research, 26:401\u2013411, 1986.","journal-title":"European Journal of Operational Research"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D. Pisinger","year":"2007","unstructured":"D. Pisinger and S. Ropke. A general heuristic for vehicle routing problems. Computers & Operations Research, 34:2403\u20132435, 2007.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10_CR22","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S. Ropke","year":"2006","unstructured":"S. Ropke and D. Pisinger. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4):455\u2013472, 2006.","journal-title":"Transportation Science"},{"issue":"2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G. Schrimpf","year":"2000","unstructured":"G. Schrimpf, J. Schneider, H. Stamm-Wilbrandt, and G. Dueck. Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics, 159(2):139\u2013171, 2000.","journal-title":"Journal of Computational Physics"},{"key":"10_CR24","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:133\u2013151, 2004.","journal-title":"INFORMS Journal on Computing"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.ejor.2004.08.015","volume":"169","author":"M. Yagiura","year":"2006","unstructured":"M. Yagiura, T. Ibaraki, and F. Glover. A path relinking approach with ejection chains for the generalized assignment problem. European Journal of Operational Research, 169:548\u2013569, 2006.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disopt.2004.03.005","volume":"1","author":"M. Yagiura","year":"2004","unstructured":"M. Yagiura, S. Iwasaki, T. Ibaraki, and F. Glover. A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discrete Optimization, 1(1):87\u201398, 2004.","journal-title":"Discrete Optimization"}],"container-title":["Annals of Information Systems","Matheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-1306-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,20]],"date-time":"2024-03-20T09:41:30Z","timestamp":1710927690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-1306-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9781441913050","9781441913067"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-1306-7_10","relation":{},"ISSN":["1934-3221","1934-3213"],"issn-type":[{"type":"print","value":"1934-3221"},{"type":"electronic","value":"1934-3213"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"1 September 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}