{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:01:56Z","timestamp":1760709716222,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,9,24]],"date-time":"2018-09-24T00:00:00Z","timestamp":1537747200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10288-018-0389-z","type":"journal-article","created":{"date-parts":[[2018,9,24]],"date-time":"2018-09-24T03:42:23Z","timestamp":1537760543000},"page":"261-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8347-169X","authenticated-orcid":false,"given":"Salim","family":"Haddadi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,24]]},"reference":[{"issue":"3","key":"389_CR1","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10589-008-9183-8","volume":"45","author":"P Avella","year":"2008","unstructured":"Avella P, Boccia M, Vasilyev I (2008) A computational study of exact knapsack separation for the generalized assignment problem. Comput Optim Appl 45(3):543\u2013555. \n                    https:\/\/doi.org\/10.1007\/s10589-008-9183-8","journal-title":"Comput Optim Appl"},{"issue":"1","key":"389_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/s0377-2217(03)00381-3","volume":"159","author":"J Barbas","year":"2004","unstructured":"Barbas J, Mar\u00edn \u00c1 (2004) Maximal covering code multiplexing access telecommunication networks. Eur J Oper Res 159(1):219\u2013238. \n                    https:\/\/doi.org\/10.1016\/s0377-2217(03)00381-3","journal-title":"Eur J Oper Res"},{"issue":"1","key":"389_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/s0377-2217(01)00107-2","volume":"138","author":"GM Campbell","year":"2002","unstructured":"Campbell GM, Diaby M (2002) Development and evaluation of an assignment heuristic for allocating cross-trained workers. Eur J Oper Res 138(1):9\u201320. \n                    https:\/\/doi.org\/10.1016\/s0377-2217(01)00107-2","journal-title":"Eur J Oper Res"},{"issue":"8","key":"389_CR4","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1057\/jors.1995.131","volume":"46","author":"JF Campbell","year":"1995","unstructured":"Campbell JF, Langevin A (1995) The snow disposal assignment problem. J Oper Res Soc 46(8):919\u2013929. \n                    https:\/\/doi.org\/10.1057\/jors.1995.131","journal-title":"J Oper Res Soc"},{"issue":"3","key":"389_CR5","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/s0377-2217(97)00054-4","volume":"108","author":"D Cattrysse","year":"1998","unstructured":"Cattrysse D, Degraeve Z, Tistaert J (1998) Solving the generalised assignment problem using polyhedral results. Eur J Oper Res 108(3):618\u2013628. \n                    https:\/\/doi.org\/10.1016\/s0377-2217(97)00054-4","journal-title":"Eur J Oper Res"},{"issue":"3","key":"389_CR6","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri C, Khanna S (2005) A polynomial time approximation scheme for the multiple knapsack problem. SIAM J Comput 35(3):713\u2013728. \n                    https:\/\/doi.org\/10.1137\/S0097539700382820","journal-title":"SIAM J Comput"},{"issue":"1","key":"389_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/s0305-0548(96)00032-9","volume":"24","author":"PC Chu","year":"1997","unstructured":"Chu PC, Beasley JE (1997) A genetic algorithm for the generalised assignment problem. Comput Oper Res 24(1):17\u201323. \n                    https:\/\/doi.org\/10.1016\/s0305-0548(96)00032-9","journal-title":"Comput Oper Res"},{"issue":"4","key":"389_CR8","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ipl.2006.06.003","volume":"100","author":"R Cohen","year":"2006","unstructured":"Cohen R, Katzir L, Raz D (2006) An efficient approximation for the generalized assignment problem. Inform Process Lett 100(4):162\u2013166. \n                    https:\/\/doi.org\/10.1016\/j.ipl.2006.06.003","journal-title":"Inform Process Lett"},{"issue":"2","key":"389_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s101090050009","volume":"1","author":"RG Cromley","year":"1999","unstructured":"Cromley RG, Hanink DM (1999) Coupling land use allocation models with raster GIS. J Geogr Syst 1(2):137\u2013153. \n                    https:\/\/doi.org\/10.1007\/s101090050009","journal-title":"J Geogr Syst"},{"issue":"1","key":"389_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/s0377-2217(00)00108-9","volume":"132","author":"JA D\u00edaz","year":"2001","unstructured":"D\u00edaz JA, Fern\u00e1ndez E (2001) A tabu search heuristic for the generalized assignment problem. Eur J Oper Res 132(1):22\u201338. \n                    https:\/\/doi.org\/10.1016\/s0377-2217(00)00108-9","journal-title":"Eur J Oper Res"},{"issue":"1","key":"389_CR11","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/opre.49.1.52.11189","volume":"49","author":"G Dobson","year":"2001","unstructured":"Dobson G, Nambimadom RS (2001) The batch loading and scheduling problem. Oper Res 49(1):52\u201365. \n                    https:\/\/doi.org\/10.1287\/opre.49.1.52.11189","journal-title":"Oper Res"},{"key":"389_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1023\/a:1018968625626","volume":"69","author":"LR Foulds","year":"1997","unstructured":"Foulds LR, Wilson JM (1997) A variation of the generalized assignment problem arising in the New Zealand dairy industry. Ann Oper Res 69:105\u2013114. \n                    https:\/\/doi.org\/10.1023\/a:1018968625626","journal-title":"Ann Oper Res"},{"issue":"2","key":"389_CR13","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2016.04.065","volume":"255","author":"V Fran\u00e7ois","year":"2016","unstructured":"Fran\u00e7ois V, Arda Y, Crama Y, Laporte G (2016) Large neighborhood search for multi-trip vehicle routing. Eur J Oper Res 255(2):422\u2013441. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2016.04.065","journal-title":"Eur J Oper Res"},{"issue":"1","key":"389_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.ejor.2016.03.040","volume":"254","author":"P Grangier","year":"2016","unstructured":"Grangier P, Gendreau M, Lehu\u00e9d\u00e9 F, Rousseau LM (2016) An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Eur J Oper Res 254(1):80\u201391. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2016.03.040","journal-title":"Eur J Oper Res"},{"issue":"4","key":"389_CR15","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1080\/03155986.1999.11732392","volume":"37","author":"S Haddadi","year":"1999","unstructured":"Haddadi S (1999) Lagrangian decomposition based heuristic for the generalized assignment problem. INFOR 37(4):392\u2013402. \n                    https:\/\/doi.org\/10.1080\/03155986.1999.11732392","journal-title":"INFOR"},{"issue":"1","key":"389_CR16","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/s0377-2217(02)00710-5","volume":"153","author":"S Haddadi","year":"2004","unstructured":"Haddadi S, Ouzia H (2004) Effective algorithm and heuristic for the generalized assignment problem. Eur J Oper Res 153(1):184\u2013190. \n                    https:\/\/doi.org\/10.1016\/s0377-2217(02)00710-5","journal-title":"Eur J Oper Res"},{"issue":"1","key":"389_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1504\/IJMOR.2018.092962","volume":"13","author":"S Haddadi","year":"2018","unstructured":"Haddadi S, Cheraitia M, Salhi A (2018) A two-phase heuristic for set covering. Int J Math Oper Res 13(1):61\u201378. \n                    https:\/\/doi.org\/10.1504\/IJMOR.2018.092962","journal-title":"Int J Math Oper Res"},{"key":"389_CR18","doi-asserted-by":"crossref","unstructured":"Higgins AJ (1999) Optimizing cane supply decisions within a sugar mill region. J Sched 2(5):229\u2013244. 10.1002\/(SICI)1099-1425(199909\/10)2:5\n                    \n                      \n                    \n                    $$<$$\n                    \n                      \n                        <\n                      \n                    \n                  229::AID-JOS29\n                    \n                      \n                    \n                    $$>$$\n                    \n                      \n                        >\n                      \n                    \n                  3.0.CO;2-L","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<229::AID-JOS29>3.0.CO;2-L"},{"issue":"10","key":"389_CR19","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1016\/s0305-0548(00)00024-1","volume":"28","author":"AJ Higgins","year":"2001","unstructured":"Higgins AJ (2001) A dynamic tabu search for large-scale generalised assignment problems. Comput Oper Res 28(10):1039\u20131048. \n                    https:\/\/doi.org\/10.1016\/s0305-0548(00)00024-1","journal-title":"Comput Oper Res"},{"issue":"1","key":"389_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/s0167-6377(03)00074-9","volume":"32","author":"DS Hochbaum","year":"2004","unstructured":"Hochbaum DS (2004) Monotonizing linear programs with up to two nonzeroes per column. Oper Res Lett 32(1):49\u201358. \n                    https:\/\/doi.org\/10.1016\/s0167-6377(03)00074-9","journal-title":"Oper Res Lett"},{"issue":"5","key":"389_CR21","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1080\/09720502.2008.10700590","volume":"11","author":"S Mitrovi\u0107-Mini\u0107","year":"2008","unstructured":"Mitrovi\u0107-Mini\u0107 S, Punnen AP (2008) Very large-scale variable neighborhood search for the generalized assignment problem. J Interdiscipl Math 11(5):653\u2013670. \n                    https:\/\/doi.org\/10.1080\/09720502.2008.10700590","journal-title":"J Interdiscipl Math"},{"issue":"2","key":"389_CR22","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/j.ejor.2004.06.015","volume":"168","author":"MAS Monfared","year":"2006","unstructured":"Monfared MAS, Etemadi M (2006) The impact of energy function structure on solving generalized assignment problem using Hopfield neural network. Eur J Oper Res 168(2):645\u2013654. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2004.06.015","journal-title":"Eur J Oper Res"},{"issue":"3","key":"389_CR23","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1287\/ijoc.15.3.249.16075","volume":"15","author":"RM Nauss","year":"2003","unstructured":"Nauss RM (2003) Solving the generalized assignment problem: an optimizing and heuristic approach. INFORMS J Comput 15(3):249\u2013266. \n                    https:\/\/doi.org\/10.1287\/ijoc.15.3.249.16075","journal-title":"INFORMS J Comput"},{"issue":"3","key":"389_CR24","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/s0377-2217(97)00408-6","volume":"112","author":"J Nowakovski","year":"1999","unstructured":"Nowakovski J, Schw\u00e4rzler W, Triesch E (1999) Using the generalized assignment problem in scheduling the ROSAT space telescope. Eur J Oper Res 112(3):531\u2013541. \n                    https:\/\/doi.org\/10.1016\/s0377-2217(97)00408-6","journal-title":"Eur J Oper Res"},{"issue":"3","key":"389_CR25","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.orl.2005.05.006","volume":"34","author":"Z Nutov","year":"2006","unstructured":"Nutov Z, Beniaminy I, Yuster R (2006) A \n                    \n                      \n                    \n                    $$(1{-}1\/\\epsilon )$$\n                    \n                      \n                        \n                          (\n                          1\n                          -\n                          1\n                          \/\n                          \u03f5\n                          )\n                        \n                      \n                    \n                  -approximation algorithm for the generalized assignment problem. Oper Res Lett 34(3):283\u2013288. \n                    https:\/\/doi.org\/10.1016\/j.orl.2005.05.006","journal-title":"Oper Res Lett"},{"issue":"3","key":"389_CR26","doi-asserted-by":"publisher","first-page":"123","DOI":"10.3138\/infor.45.3.123","volume":"45","author":"T \u00d6ncan","year":"2007","unstructured":"\u00d6ncan T (2007) A survey of the generalized assignment problem and its applications. INFOR 45(3):123\u2013141. \n                    https:\/\/doi.org\/10.3138\/infor.45.3.123","journal-title":"INFOR"},{"issue":"11","key":"389_CR27","doi-asserted-by":"publisher","first-page":"3782","DOI":"10.1016\/j.amc.2009.11.018","volume":"215","author":"L \u00d6zbakir","year":"2010","unstructured":"\u00d6zbakir L, Baykaso\u011flu A, Tapkan P (2010) Bees algorithm for generalized assignment problem. Appl Math Comput 215(11):3782\u20133795. \n                    https:\/\/doi.org\/10.1016\/j.amc.2009.11.018","journal-title":"Appl Math Comput"},{"key":"389_CR28","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.endm.2005.05.052","volume":"19","author":"A Pigatti","year":"2005","unstructured":"Pigatti A, de Arag\u00e3o MP, Uchoa E (2005) Stabilized branch-and-cut-and-price for the generalized assignment problem. Electron Notes Discrete Math 19:389\u2013395. \n                    https:\/\/doi.org\/10.1016\/j.endm.2005.05.052","journal-title":"Electron Notes Discrete Math"},{"key":"389_CR29","doi-asserted-by":"crossref","unstructured":"Pisinger D, Ropke S (2010) Large neighborhood search. In: Handbook of metaheuristics. Springer Nature, pp 399\u2013419. \n                    https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_13","DOI":"10.1007\/978-1-4419-1665-5_13"},{"issue":"3","key":"389_CR30","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s10589-011-9432-0","volume":"52","author":"M Posta","year":"2011","unstructured":"Posta M, Ferland JA, Michelon P (2011) An exact method with variable fixing for solving the generalized assignment problem. Comput Optim Appl 52(3):629\u2013644. \n                    https:\/\/doi.org\/10.1007\/s10589-011-9432-0","journal-title":"Comput Optim Appl"},{"issue":"4","key":"389_CR31","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1023\/a:1009618009594","volume":"4","author":"C Privault","year":"1998","unstructured":"Privault C, Herault L (1998) Solving a realworld assignment problem with a metaheuristic. J Heuristics 4(4):383\u2013398. \n                    https:\/\/doi.org\/10.1023\/a:1009618009594","journal-title":"J Heuristics"},{"issue":"1","key":"389_CR32","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1111\/j.1475-3995.1999.tb00143.x","volume":"6","author":"KS Ruland","year":"1999","unstructured":"Ruland KS (1999) A model for aeromedical routing and scheduling. Int Trans Oper Res 6(1):57\u201373. \n                    https:\/\/doi.org\/10.1111\/j.1475-3995.1999.tb00143.x","journal-title":"Int Trans Oper Res"},{"issue":"6","key":"389_CR33","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M Savelsbergh","year":"1997","unstructured":"Savelsbergh M (1997) A branch-and-price algorithm for the generalized assignment problem. Oper Res 45(6):831\u2013841. \n                    https:\/\/doi.org\/10.1287\/opre.45.6.831","journal-title":"Oper Res"},{"issue":"8","key":"389_CR34","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1057\/palgrave.jors.2600431","volume":"48","author":"JM Wilson","year":"1997","unstructured":"Wilson JM (1997) A genetic algorithm for the generalised assignment problem. J Oper Res Soc 48(8):804\u2013809. \n                    https:\/\/doi.org\/10.1057\/palgrave.jors.2600431","journal-title":"J Oper Res Soc"},{"issue":"2","key":"389_CR35","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1016\/j.ejor.2010.05.007","volume":"207","author":"AJ Woodcock","year":"2010","unstructured":"Woodcock AJ, Wilson JM (2010) A hybrid tabu search\/branch & bound approach to solving the generalized assignment problem. Eur J Oper Res 207(2):566\u2013578. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2010.05.007","journal-title":"Eur J Oper Res"},{"issue":"2","key":"389_CR36","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1080\/10556789808805722","volume":"10","author":"M Yagiura","year":"1998","unstructured":"Yagiura M, Yamaguchi T, Ibaraki T (1998) A variable depth search algorithm with branching search for the generalized assignment problem. Optim Method Softw 10(2):419\u2013441. \n                    https:\/\/doi.org\/10.1080\/10556789808805722","journal-title":"Optim Method Softw"},{"issue":"2","key":"389_CR37","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.1030.0036","volume":"16","author":"M Yagiura","year":"2004","unstructured":"Yagiura M, Ibaraki T, Glover F (2004) An ejection chain approach for the generalized assignment problem. INFORMS J Comput 16(2):133\u2013151. \n                    https:\/\/doi.org\/10.1287\/ijoc.1030.0036","journal-title":"INFORMS J Comput"},{"issue":"2","key":"389_CR38","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.ejor.2004.08.015","volume":"169","author":"M Yagiura","year":"2006","unstructured":"Yagiura M, Ibaraki T, Glover F (2006) A path relinking approach with ejection chains for the generalized assignment problem. Eur J Oper Res 169(2):548\u2013569. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2004.08.015","journal-title":"Eur J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0389-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-018-0389-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0389-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T07:40:03Z","timestamp":1571816403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-018-0389-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,24]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["389"],"URL":"https:\/\/doi.org\/10.1007\/s10288-018-0389-z","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2018,9,24]]},"assertion":[{"value":"26 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"We have declared that no conflict of interest exists.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by the author.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}