{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T10:15:12Z","timestamp":1774260912626,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,9,13]],"date-time":"2011-09-13T00:00:00Z","timestamp":1315872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10589-011-9432-0","type":"journal-article","created":{"date-parts":[[2011,9,12]],"date-time":"2011-09-12T13:25:51Z","timestamp":1315833951000},"page":"629-644","source":"Crossref","is-referenced-by-count":43,"title":["An exact method with variable fixing for solving the generalized assignment problem"],"prefix":"10.1007","volume":"52","author":[{"given":"Marius","family":"Posta","sequence":"first","affiliation":[]},{"given":"Jacques A.","family":"Ferland","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Michelon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,13]]},"reference":[{"issue":"1","key":"9432_CR1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10479-005-3968-2","volume":"140","author":"A. Atamt\u00fcrk","year":"2005","unstructured":"Atamt\u00fcrk, A., Savelsbergh, M.W.P.: Integer-programming software systems. Ann. Oper. Res. 140(1), 67\u2013124 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"9432_CR2","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10589-008-9183-8","volume":"45","author":"P. Avella","year":"2010","unstructured":"Avella, P., Boccia, M., Vasilyev, I.: A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45(3), 543\u2013555 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"9432_CR3","unstructured":"Beasley, J.E.: Generalised assignment problem test data sets. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/gapinfo.html"},{"issue":"1","key":"9432_CR4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/S0377-2217(00)00108-9","volume":"132","author":"J.A. Diaz","year":"2001","unstructured":"Diaz, J.A., Fernandez, E.: A tabu search heuristic for the generalized assignment problem. Eur. J. Oper. Res. 132(1), 22\u201338 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"9432_CR5","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/0305-0548(96)00006-8","volume":"23","author":"A. Frangioni","year":"1996","unstructured":"Frangioni, A.: Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Comput. Oper. Res. 23(11), 1099\u20131118 (1996)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9432_CR6","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0377-2217(02)00710-5","volume":"153","author":"S. Haddadi","year":"2004","unstructured":"Haddadi, S., Ouzia, H.: Effective algorithm and heuristic for the generalized assignment problem. Eur. J. Oper. Res. 153(1), 184\u2013190 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9432_CR7","unstructured":"Karabakal, N., Bean, J.C., Lohmann, J.R.: A steepest descent multiplier adjustment method for the generalized assignment problem. Technical report, University of Michigan (1992)"},{"issue":"3","key":"9432_CR8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1287\/ijoc.15.3.249.16075","volume":"15","author":"R.M. Nauss","year":"2003","unstructured":"Nauss, R.M.: Solving the generalized assignment problem: an optimizing and heuristic approach. INFORMS J. Comput. 15(3), 249\u2013266 (2003)","journal-title":"INFORMS J. Comput."},{"key":"9432_CR9","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.endm.2005.05.052","volume":"5","author":"A. Pigatti","year":"2005","unstructured":"Pigatti, A., de Aragao, M.P., Uchoa, E.: Stabilized branch-and-cut-and-price for the generalized assignment problem. Electron. Notes Discrete Math. 5, 389\u2013395 (2005)","journal-title":"Electron. Notes Discrete Math."},{"issue":"5","key":"9432_CR10","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D. Pisinger","year":"1997","unstructured":"Pisinger, D.: A minimal algorithm for the 0-1 knapsack problem. Oper. Res. 45(5), 758\u2013767 (1997)","journal-title":"Oper. Res."},{"issue":"1","key":"9432_CR11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","volume":"8","author":"G.T. Ross","year":"1975","unstructured":"Ross, G.T., Soland, R.M.: A branch and bound algorithm for the generalized assignment problem. Math. Program. 8(1), 91\u2013103 (1975)","journal-title":"Math. Program."},{"issue":"6","key":"9432_CR12","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M. Savelsbergh","year":"1997","unstructured":"Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6), 831\u2013841 (1997)","journal-title":"Oper. Res."},{"key":"9432_CR13","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"},{"issue":"2","key":"9432_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.1030.0036","volume":"16","author":"M. Yagiura","year":"2004","unstructured":"Yagiura, M., Ibaraki, T., Glover, F.: An ejection chain approach for the generalized assignment problem. INFORMS J. Comput. 16(2), 133\u2013151 (2004)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"9432_CR15","doi-asserted-by":"crossref","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.: A path relinking approach with ejection chains for the generalized assignment problem. Eur. J. Oper. Res. 169(2), 548\u2013569 (2006)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9432-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9432-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9432-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:41Z","timestamp":1559288201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9432-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,13]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9432"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9432-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,13]]}}}