{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T03:46:16Z","timestamp":1772855176600,"version":"3.50.1"},"publisher-location":"Boston, MA","reference-count":92,"publisher":"Springer US","isbn-type":[{"value":"9780387747583","type":"print"},{"value":"9780387747590","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_200","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:01:26Z","timestamp":1219662086000},"page":"1153-1162","source":"Crossref","is-referenced-by-count":23,"title":["Generalized Assignment Problem"],"prefix":"10.1007","author":[{"given":"O. Erhun","family":"Kundakcioglu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saed","family":"Alizamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"200_CR1_200","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.ejor.2005.01.035","volume":"173","author":"M Albareda-Sambola","year":"2006","unstructured":"Albareda-Sambola M, van\u00a0der\u00a0Vlerk MH, Fernandez E (2006) Exact solutions to a\u00a0class of\nstochastic generalized assignment problems.  Eur J Oper Res 173:465\u2013487","journal-title":"Eur J Oper Res"},{"issue":"7","key":"200_CR2_200","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1287\/mnsc.40.7.868","volume":"40","author":"MM Amini","year":"1994","unstructured":"Amini MM, Racer M (1994) A\u00a0rigorous computational comparison of alternative solution\nmethods for the generalized assignment problem.  Manag Sci 40(7):868\u2013890","journal-title":"Manag Sci"},{"issue":"2","key":"200_CR3_200","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0377-2217(94)00154-5","volume":"87","author":"MM Amini","year":"1995","unstructured":"Amini MM, Racer M (1995)\n A\u00a0hybrid heuristic for the generalized assignment problem.\n   Eur J Oper Res 87(2):343\u2013348","journal-title":"Eur J Oper Res"},{"key":"200_CR4_200","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/1055678031000107105","volume":"18","author":"Y Asahiro","year":"2003","unstructured":"Asahiro Y, Ishibashi M, Yamashita M (2003) Independent and cooperative parallel search\nmethods for the generalized assignment problem.  Optim Method Softw 18:129\u2013141","journal-title":"Optim Method Softw"},{"issue":"4","key":"200_CR5_200","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1287\/opre.24.4.742","volume":"24","author":"V Balachandran","year":"1976","unstructured":"Balachandran V (1976) An integer generalized transportation model for optimal job\nassignment in computer networks. Oper Res 24(4):742\u2013759","journal-title":"Oper Res"},{"issue":"3","key":"200_CR6_200","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998)\nBranch-and-price: column generation for solving huge integer programs.  Oper Res 46(3):316\u2013329","journal-title":"Oper Res"},{"key":"200_CR7_200","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","volume":"65","author":"JE Beasley","year":"1993","unstructured":"Beasley JE (1993) Lagrangean heuristics for location problems.  Eur J\nOper Res 65:383\u2013399","journal-title":"Eur J Oper Res"},{"key":"200_CR8_200","first-page":"297","volume":"34","author":"MC Cario","year":"2002","unstructured":"Cario MC, Clifford JJ, Hill RR, Yang J, Yang K, Reilly CH (2002) An investigation of\nthe relationship between problem characteristics and algorithm performance: a\u00a0case study of the gap.\nIIE Trans 34:297\u2013313","journal-title":"IIE Trans"},{"key":"200_CR9_200","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0377-2217(94)90338-7","volume":"72","author":"DG Cattrysse","year":"1994","unstructured":"Cattrysse DG, Salomon M, Van LN Wassenhove (1994) A\u00a0set partitioning heuristic for the\ngeneralized assignment problem.  Eur J Oper Res 72:167\u2013174","journal-title":"Eur J Oper Res"},{"key":"200_CR10_200","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","volume":"60","author":"DG Cattrysse","year":"1992","unstructured":"Cattrysse DG, Van LN Wassenhove (1992) A\u00a0survey of algorithms for the generalized\nassignment problem.  Eur J Oper Res 60:260\u2013272","journal-title":"Eur J Oper Res"},{"key":"200_CR11_200","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.1287\/opre.1060.0323","volume":"54","author":"A Ceselli","year":"2006","unstructured":"Ceselli A, Righini G (2006) A\u00a0branch-and-price algorithm for the multilevel generalized\nassignment problem.  Oper Res 54:1172\u20131184","journal-title":"Oper Res"},{"key":"200_CR12_200","first-page":"103","volume-title":"Advances in OR","author":"L Chalmet","year":"1976","unstructured":"Chalmet L, Gelders L (1976) Lagrangean relaxation for a\u00a0generalized assignment type\nproblem.  In: Advances in OR. EURO, North Holland, Amsterdam, pp\u00a0103\u2013109"},{"key":"200_CR13_200","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0305-0548(96)00032-9","volume":"24","author":"EC Chu","year":"1997","unstructured":"Chu EC, Beasley JE (1997) A\u00a0genetic algorithm for the generalized assignment problem.\nComput Oper Res 24:17\u201323","journal-title":"Comput Oper Res"},{"key":"200_CR14_200","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\nassignment problem.  Inf Process Lett 100:162\u2013166","journal-title":"Inf Process Lett"},{"key":"200_CR15_200","doi-asserted-by":"crossref","unstructured":"de\u00a0Farias Jr, Johnson EL, Nemhauser GL (2000) A\u00a0generalized assignment problem with\nspecial ordered sets: a\u00a0polyhedral approach. Math Program, Ser A 89:187\u2013203","DOI":"10.1007\/PL00011392"},{"key":"200_CR16_200","doi-asserted-by":"crossref","unstructured":"de\u00a0Farias Jr, Nemhauser GL (2001) A\u00a0family of inequalities for the generalized\nassignment polytope.  Oper Res Lett 29:49\u201355","DOI":"10.1016\/S0167-6377(01)00086-4"},{"key":"200_CR17_200","doi-asserted-by":"crossref","unstructured":"DeMaio A, Roveda C (1971) An all zero-one algorithm for a class of\ntransportation problems. Oper Res 19:1406\u20131418","DOI":"10.1287\/opre.19.6.1406"},{"key":"200_CR18_200","doi-asserted-by":"crossref","unstructured":"Diaz JA, Fernandez E (2001) A\u00a0tabu search heuristic for the generalized assignment\nproblem.  Eur J Oper Res 132:22\u201338","DOI":"10.1016\/S0377-2217(00)00108-9"},{"key":"200_CR19_200","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1287\/mnsc.37.12.1590","volume":"37","author":"A Drexl","year":"1991","unstructured":"Drexl A (1991) Scheduling of project networks by job assignment. Manag Sci\n37:1590\u20131602","journal-title":"Manag Sci"},{"key":"200_CR20_200","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF01581197","volume":"55","author":"M Dyer","year":"1992","unstructured":"Dyer M, Frieze A (1992) Probabilistic analysis of the generalised assignment problem.\nMath Program 55:169\u2013181","journal-title":"Math Program"},{"key":"200_CR21_200","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1145\/967900.968102","volume-title":"SAC '04; Proceedings of the 2004 ACM symposium on Applied computing","author":"H Feltl","year":"2004","unstructured":"Feltl H, Raidl GR (2004) An improved hybrid genetic algorithm for the generalized\nassignment problem. In: SAC '04; Proceedings of the 2004 ACM symposium on Applied computing. ACM\nPress, New York, pp\u00a0990\u2013995"},{"key":"200_CR22_200","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"ML Fisher","year":"1981","unstructured":"Fisher ML, Jaikumar R (1981) A\u00a0generalized assignment heuristic for vehicle routing.\nNetw 11:109\u2013124","journal-title":"Netw"},{"key":"200_CR23_200","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"ML Fisher","year":"1986","unstructured":"Fisher ML, Jaikumar R, van\u00a0Wassenhove LN (1986) A\u00a0multiplier adjustment method for\nthe generalized assignment problem.  Manag Sci 32:1095\u20131103","journal-title":"Manag Sci"},{"key":"200_CR24_200","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1145\/1109557.1109624","volume-title":"Tight approximation algorithms for maximum general assignment problems. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm","author":"L Fleischer","year":"2006","unstructured":"Fleischer L, Goemans MX, Mirrokni VS, Sviridenko M (2006) Tight approximation\nalgorithms for maximum general assignment problems.  In SODA '06: Proceedings of the seventeenth\nannual ACM-SIAM symposium on Discrete algorithm. ACM Press, New York, pp\u00a0611\u2013620"},{"issue":"6","key":"200_CR25_200","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1287\/opre.51.6.922.24914","volume":"51","author":"R Freling","year":"2003","unstructured":"Freling R, Romeijn HE, Morales DR, Wagelmans APM (2003) A\u00a0branch-and-price algorithm\nfor the multiperiod single-sourcing problem.  Oper Res 51(6):922\u2013939","journal-title":"Oper Res"},{"key":"200_CR26_200","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1017900606269","volume":"8","author":"AP French","year":"2002","unstructured":"French AP, Wilson JM (2002) Heuristic solution methods for the multilevel generalized\nassignment problem.  J\u00a0Heuristics 8:143\u2013153","journal-title":"J Heuristics"},{"key":"200_CR27_200","doi-asserted-by":"publisher","first-page":"2359","DOI":"10.1016\/j.cor.2005.09.008","volume":"34","author":"AP French","year":"2007","unstructured":"French AP, Wilson JM (2007) An lp-based heuristic procedure for the generalized\nassignment problem with special ordered sets.  Comput Oper Res 34:2359\u20132369","journal-title":"Comput Oper Res"},{"key":"200_CR28_200","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey MR, Johnson DS (1990) Computers and Intractability; A\u00a0Guide to the Theory of\nNP-Completeness.  Freeman, New York"},{"key":"200_CR29_200","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1287\/mnsc.37.6.695","volume":"37","author":"B Gavish","year":"1991","unstructured":"Gavish B, Pirkul H (1991) Algorithms for the multi-resource generalized assignment\nproblem.  Manag Sci 37:695\u2013713","journal-title":"Manag Sci"},{"issue":"5","key":"200_CR30_200","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion AM, Graves GW (1974) Multicommodity distribution system design by benders\ndecomposition.  Manag Sci 20(5):822\u2013844","journal-title":"Manag Sci"},{"key":"200_CR31_200","first-page":"17","volume":"4","author":"F Glover","year":"1979","unstructured":"Glover F, Hultz J, Klingman D (1979) Improved computer based planning techniques, part\nii.  Interfaces 4:17\u201324","journal-title":"Interfaces"},{"issue":"1","key":"200_CR32_200","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01585726","volume":"46","author":"ES Gottlieb","year":"1990","unstructured":"Gottlieb ES, Rao MR (1990) $$ (1,k) $$-configuration facets for the generalized assignment\nproblem.  Math Program 46(1):53\u201360","journal-title":"Math Program"},{"key":"200_CR33_200","first-page":"31","volume":"46","author":"ES Gottlieb","year":"1990","unstructured":"Gottlieb ES, Rao MR (1990) The generalized assignment problem: Valid inequalities and\nfacets.  Math Stat 46:31\u201352","journal-title":"Math Stat"},{"issue":"4","key":"200_CR34_200","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1287\/opre.37.4.658","volume":"37","author":"M Guignard","year":"1989","unstructured":"Guignard M, Rosenwein MB (1989) An improved dual based algorithm for the generalized\nassignment problem. Oper Res 37(4):658\u2013663","journal-title":"Oper Res"},{"key":"200_CR35_200","first-page":"392","volume":"37","author":"S Haddadi","year":"1999","unstructured":"Haddadi S (1999) Lagrangian decomposition based heuristic for the generalized\nassignment problem.  Inf Syst Oper Res 37:392\u2013402","journal-title":"Inf Syst Oper Res"},{"key":"200_CR36_200","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\nassignment problem.  Eur J Oper Res 153:184\u2013190","journal-title":"Eur J Oper Res"},{"key":"200_CR37_200","first-page":"214","volume":"33","author":"S Hajri-Gabouj","year":"2003","unstructured":"Hajri-Gabouj S (2003) A\u00a0fuzzy genetic multiobjective optimization algorithm for\na\u00a0multilevel generalized assignment problem. IEEE Trans Syst 33:214\u2013224","journal-title":"IEEE Trans Syst"},{"key":"200_CR38_200","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1021\/ie050478h","volume":"45","author":"SL Janak","year":"2006","unstructured":"Janak SL, Taylor MS, Floudas CA, Burka M, Mountziaris TJ (2006) Novel and effective\ninteger optimization approach for the nsf panel-assignment problem: a\u00a0multiresource and\npreference-constrained generalized assignment problem.  Ind Eng Chem Res\n45:258\u2013265","journal-title":"Ind Eng Chem Res"},{"key":"200_CR39_200","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0377-2217(86)90328-0","volume":"27","author":"K J\u00f6rnsten","year":"1986","unstructured":"J\u00f6rnsten K, Nasberg M (1986) A\u00a0new lagrangian relaxation approach to the generalized\nassignment problem.  Eur J Oper Res 27:313\u2013323","journal-title":"Eur J Oper Res"},{"key":"200_CR40_200","unstructured":"J\u00f6rnsten KO, Varbrand P (1990) Relaxation techniques and valid inequalities applied to\nthe generalized assignment problem.  Asia-P J Oper Res 7(2):172\u2013189"},{"key":"200_CR41_200","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0305-0548(79)90028-5","volume":"6","author":"TD Klastorin","year":"1979","unstructured":"Klastorin TD (1979) An effective subgradient algorithm for the generalized assignment\nproblem. Comp Oper Res 6:155\u2013164","journal-title":"Comp Oper Res"},{"issue":"1","key":"200_CR42_200","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1287\/mnsc.25.1.107","volume":"25","author":"TD Klastorin","year":"1979","unstructured":"Klastorin TD (1979) On the maximal covering location problem and the generalized\nassignment problem.  Manag Sci 25(1):107\u2013112","journal-title":"Manag Sci"},{"key":"200_CR43_200","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10898-004-4273-3","volume":"31","author":"K Kogan","year":"2005","unstructured":"Kogan K, Khmelnitsky E, Ibaraki T (2005) Dynamic generalized assignment problems with\nstochastic demands and multiple agent task relationships. J\u00a0Glob Optim 31:17\u201343","journal-title":"J Glob Optim"},{"key":"200_CR44_200","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1018933012422","volume":"69","author":"K Kogan","year":"1997","unstructured":"Kogan K, Shtub A, Levit VE (1997) Dgap\u00a0\u2013 the dynamic generalized assignment problem.\nAnn Oper Res 69:227\u2013239","journal-title":"Ann Oper Res"},{"key":"200_CR45_200","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01325036","volume":"7","author":"H Kuhn","year":"1995","unstructured":"Kuhn H (1995) A\u00a0heuristic algorithm for the loading problem in flexible manufacturing\nsystems.  Int J Flex Manuf Syst 7:229\u2013254","journal-title":"Int J Flex Manuf Syst"},{"key":"200_CR46_200","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","volume":"82","author":"M Laguna","year":"1995","unstructured":"Laguna M, Kelly JP, Gonzfilez-Velarde JL, Glover F (1995) Tabu search for the\nmultilevel generalized assignment problem.  Eur J Oper Res 82:176\u2013189","journal-title":"Eur J Oper Res"},{"key":"200_CR47_200","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E Lawler","year":"1976","unstructured":"Lawler E (1976) Combinatorial Optimization: Networks and Matroids.  Holt, Rinehart,\nWinston, New York"},{"key":"200_CR48_200","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1080\/00207160108805083","volume":"77","author":"BMT Lin","year":"2001","unstructured":"Lin BMT, Huang YS, Yu HK (2001) On the variable-depth-search heuristic for the\nlinear-cost generalized assignment problem.  Int J Comput Math 77:535\u2013544","journal-title":"Int J Comput Math"},{"key":"200_CR49_200","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/0377-2217(95)00041-0","volume":"91","author":"LAN Lorena","year":"1996","unstructured":"Lorena LAN, Narciso MG (1996) Relaxation heuristics for a\u00a0generalized assignment\nproblem.  Eur J Oper Res 91:600\u2013610","journal-title":"Eur J Oper Res"},{"key":"200_CR50_200","unstructured":"Lorena LAN, Narciso MG, Beasley JE (2003) A\u00a0constructive genetic algorithm for the\ngeneralized assignment problem. J\u00a0Evol Optim"},{"key":"200_CR51_200","unstructured":"Louren\u00e7o HR, Serra D (1998) Adaptive approach heuristics for the generalized assignment\nproblem.  Technical Report 288, Department of Economics and Business, Universitat Pompeu Fabra,\nBarcelona"},{"key":"200_CR52_200","unstructured":"Louren\u00e7o HR, Serra D (2002) Adaptive search heuristics for the generalized assignment\nproblem.  Mathw Soft Comput 9(2\u20133):209\u2013234"},{"key":"200_CR53_200","unstructured":"Martello S, Toth P (1981)  An algorithm for the generalized assignment problem. In: Brans JP\n(ed) Operational Research '81, 9th IFORS Conference, North-Holland, Amsterdam, pp\u00a0589\u2013603"},{"key":"200_CR54_200","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack Problems: Algorithms and Computer Implementations.\nWiley, New York"},{"key":"200_CR55_200","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-56279-6_88","volume":"650","author":"S Martello","year":"1992","unstructured":"Martello S, Toth P (1992) Generalized assignment problems.  Lect Notes Comput Sci 650:351\u2013369","journal-title":"Lect Notes Comput Sci"},{"key":"200_CR56_200","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/0377-2217(93)E0271-X","volume":"83","author":"S Martello","year":"1995","unstructured":"Martello S, Toth P (1995) The bottleneck generalized assignment problem.  Eur\nJ Oper Res 83:621\u2013638","journal-title":"Eur J Oper Res"},{"issue":"1","key":"200_CR57_200","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-188X(88)90053-5","volume":"14","author":"JB Mazzola","year":"1988","unstructured":"Mazzola JB, Neebe AW (1988) Bottleneck generalized assignment problems.  Eng\nCosts Prod Econ 14(1):61\u201365","journal-title":"Eng Costs Prod Econ"},{"issue":"6","key":"200_CR58_200","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1002\/nav.1029","volume":"48","author":"JB Mazzola","year":"2001","unstructured":"Mazzola JB, Wilcox SP (2001) Heuristics for the multi-resource generalized assignment\nproblem.  Nav Res Logist 48(6):468\u2013483","journal-title":"Nav Res Logist"},{"key":"200_CR59_200","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\ngeneralized assignment problem using hopfield neural network.  Eur J Oper Res 168:645\u2013654","journal-title":"Eur J Oper Res"},{"key":"200_CR60_200","first-page":"259","volume-title":"The Generalized Assignment Problem and extensions","author":"DR Morales","year":"2005","unstructured":"Morales DR, Romeijn HE (2005) Handbook of Combinatorial Optimization, supplement vol\u00a0B. In: Du D-Z, Pardalos PM (eds) The Generalized Assignment Problem and extensions. Springer, New York, pp\u00a0259\u2013311"},{"key":"200_CR61_200","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0377-2217(98)00038-1","volume":"114","author":"MG Narciso","year":"1999","unstructured":"Narciso MG, Lorena LAN (1999) Lagrangean\/surrogate relaxation for generalized\nassignment problems.  Eur J Oper Res 114:165\u2013177","journal-title":"Eur J Oper Res"},{"issue":"3","key":"200_CR62_200","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\napproach.  INFORMS J Comput 15(3):249\u2013266","journal-title":"INFORMS J Comput"},{"key":"200_CR63_200","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1057\/palgrave.jors.2601806","volume":"55","author":"RM Nauss","year":"2005","unstructured":"Nauss RM (2005) The elastic generalized assignment problem.  J\u00a0Oper Res Soc\n55:1333\u20131341","journal-title":"J Oper Res Soc"},{"key":"200_CR64_200","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, Schwarzler W, Triesch E (1999) Using the generalized assignment problem\nin scheduling the rosat space telescope.  Eur J Oper Res 112:531\u2013541","journal-title":"Eur J Oper Res"},{"key":"200_CR65_200","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\u00a0$$ (1-1\/e) $$\u2010approximation algorithm for the\ngeneralized assignment problem.  Oper Res Lett 34:283\u2013288","journal-title":"Oper Res Lett"},{"issue":"12S","key":"200_CR66_200","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1287\/mnsc.44.12.S271","volume":"44","author":"JS Park","year":"1998","unstructured":"Park JS, Lim BH, Lee Y (1998) A\u00a0lagrangian dual-based branch-and-bound algorithm for\nthe generalized multi-assignment problem.  Manag Sci 44(12S):271\u2013275","journal-title":"Manag Sci"},{"key":"200_CR67_200","doi-asserted-by":"crossref","unstructured":"Pigatti A, de\u00a0Aragao MP, Uchoa E (2005) Stabilized branch-and-cut-and-price for the\ngeneralized assignment problem.  In: Electronic Notes in Discrete Mathematics, vol\u00a019 of 2nd\nBrazilian Symposium on Graphs, Algorithms and Combinatorics, pp\u00a0385\u2013395,","DOI":"10.1016\/j.endm.2005.05.052"},{"key":"200_CR68_200","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01720977","volume":"17","author":"IH Osman","year":"1995","unstructured":"Osman IH (1995) Heuristics for the generalized assignment problem: simulated annealing\nand tabu search approaches.  OR-Spektrum 17:211\u2013225","journal-title":"OR-Spektrum"},{"issue":"1","key":"200_CR69_200","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/BF02085655","volume":"50","author":"M Racer","year":"1994","unstructured":"Racer M, Amini MM (1994) A\u00a0robust heuristic for the generalized assignment problem.\nAnn Oper Res 50(1):487\u2013503","journal-title":"Ann Oper Res"},{"key":"200_CR70_200","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0166-218X(99)00224-3","volume":"103","author":"HE Romeijn","year":"2000","unstructured":"Romeijn HE, Morales DR (2000) A\u00a0class of greedy algorithms for the generalized\nassignment problem.  Discret Appl Math 103:209\u2013235","journal-title":"Discret Appl Math"},{"issue":"6","key":"200_CR71_200","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1287\/opre.49.6.866.10021","volume":"49","author":"HE Romeijn","year":"2001","unstructured":"Romeijn HE, Morales DR (2001) Generating experimental data for the generalized\nassignment problem. Oper Res 49(6):866\u2013878","journal-title":"Oper Res"},{"key":"200_CR72_200","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1023\/A:1009874227903","volume":"4","author":"HE Romeijn","year":"2000","unstructured":"Romeijn HE, Piersma N (2000) A\u00a0probabilistic feasibility and value analysis of the\ngeneralized assignment problem. J\u00a0Comb Optim 4:325\u2013355","journal-title":"J Comb Optim"},{"issue":"5","key":"200_CR73_200","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/0305-0548(92)90073-E","volume":"19","author":"D Ronen","year":"1992","unstructured":"Ronen D (1992) Allocation of trips to trucks operating from a\u00a0single terminal.\nComput Oper Res 19(5):445\u2013451","journal-title":"Comput Oper Res"},{"key":"200_CR74_200","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF01580430","volume":"8","author":"GT Ross","year":"1975","unstructured":"Ross GT, Soland RM (1975) A\u00a0branch and bound algorithm for the generalized assignment\nproblem.  Math Program 8:91\u2013103","journal-title":"Math Program"},{"key":"200_CR75_200","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/mnsc.24.3.345","volume":"24","author":"GT Ross","year":"1977","unstructured":"Ross GT, Soland RM (1977) Modeling facility location problems as generalized assignment\nproblems.  Manag Sci 24:345\u2013357","journal-title":"Manag Sci"},{"issue":"7","key":"200_CR76_200","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1287\/mnsc.25.7.683","volume":"25","author":"GT Ross","year":"1979","unstructured":"Ross GT, Zoltners AA (1979) Weighted assignment models and their application.\nManag Sci 25(7):683\u2013696","journal-title":"Manag Sci"},{"key":"200_CR77_200","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\u00a0branch-and-price algorithm for the generalized assignment\nproblem.  Oper Res 45:831\u2013841","journal-title":"Oper Res"},{"key":"200_CR78_200","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"DB Shmoys","year":"1993","unstructured":"Shmoys DB, Tardos E (1993) An approximation algorithm for the generalized assignment\nproblem.  Math Program 62:461\u2013474","journal-title":"Math Program"},{"key":"200_CR79_200","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1080\/00207548908942586","volume":"27","author":"A Shtub","year":"1989","unstructured":"Shtub A (1989) Modelling group technology cell formation as a\u00a0generalized assignment\nproblem.  Int J Prod Res 27:775\u2013782","journal-title":"Int J Prod Res"},{"issue":"1","key":"200_CR80_200","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/opre.21.1.284","volume":"21","author":"V Srinivasan","year":"1973","unstructured":"Srinivasan V, Thompson GL (1973) An algorithm for assigning uses to sources in a\u00a0special\nclass of transportation problems. Oper Res 21(1):284\u2013295","journal-title":"Oper Res"},{"key":"200_CR81_200","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-1-4615-5775-3_22","volume-title":"Meta-heuristics; Advances and trends in local search paradigms for optimization","author":"T St\u00fctzle","year":"1999","unstructured":"St\u00fctzle T, Hoos H (1999) The Max-Min Ant System and Local Search for Combinatorial\nOptimization Problems. In: Voss S, Martello S, Osman IH, Roucairol C (eds) Meta-heuristics; Advances and trends in local search\nparadigms for optimization. Kluwer, Boston, pp\u00a0313\u2013329"},{"key":"200_CR82_200","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/j.cor.2004.07.015","volume":"33","author":"B Toktas","year":"2006","unstructured":"Toktas B, Yen JW, Zabinsky ZB (2006) Addressing capacity uncertainty in\nresource-constrained assignment problems.  Comput Oper Res 33:724\u2013745","journal-title":"Comput Oper Res"},{"key":"200_CR83_200","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/1520-6750(199203)39:2<137::AID-NAV3220390202>3.0.CO;2-D","volume":"39","author":"M Trick","year":"1992","unstructured":"Trick M (1992) A\u00a0linear relaxation heuristic for the generalized assignment problem.\nNav Res Logist 39:137\u2013151","journal-title":"Nav Res Logist"},{"issue":"2","key":"200_CR84_200","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1287\/opre.42.2.234","volume":"42","author":"MA Trick","year":"1994","unstructured":"Trick MA (1994) Scheduling multiple variable-speed machines. Oper Res 42(2):234\u2013248","journal-title":"Oper Res"},{"key":"200_CR85_200","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\u00a0genetic algorithm for the generalised assignment problem.  J\u00a0Oper\nRes Soc 48:804\u2013809","journal-title":"J Oper Res Soc"},{"key":"200_CR86_200","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10732-005-3208-6","volume":"11","author":"JM Wilson","year":"2005","unstructured":"Wilson\nJM (2005) An algorithm for the generalized assignment problem with special\nordered sets. J\u00a0Heuristics 11:337\u2013350","journal-title":"J Heuristics"},{"key":"200_CR87_200","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\nassignment problem.  INFORMS J Comput 16:133\u2013151","journal-title":"INFORMS J Comput"},{"key":"200_CR88_200","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\u00a0path relinking approach with ejection chains\nfor the generalized assignment problem.  Eur J Oper Res 169:548\u2013569","journal-title":"Eur J Oper Res"},{"key":"200_CR89_200","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\u00a0variable depth search algorithm with\nbranching search for the generalized assignment problem.  Optim Method Softw 10:419\u2013441","journal-title":"Optim Method Softw"},{"key":"200_CR90_200","doi-asserted-by":"crossref","unstructured":"Yagiura M, Yamaguchi T, Ibaraki T (1999) A\u00a0variable depth search algorithm for the\ngeneralized assignment problem. In: Voss S, Martello S, Osman IH, Roucairol C (eds) Meta-heuristics; Advances and Trends in Local Search paradigms\nfor Optimization, Kluwer, Boston, pp\u00a0459\u2013471","DOI":"10.1007\/978-1-4615-5775-3_31"},{"key":"200_CR91_200","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.advengsoft.2006.06.003","volume":"38","author":"CW Zhang","year":"2007","unstructured":"Zhang CW, Ong HL (2007) An efficient solution to biobjective generalized assignment\nproblem.  Adv Eng Softw 38:50\u201358","journal-title":"Adv Eng Softw"},{"key":"200_CR92_200","first-page":"484","volume":"49","author":"VA Zimokha","year":"1988","unstructured":"Zimokha VA, Rubinshtein MI (1988) R & d planning and the generalized assignment\nproblem.  Autom Remote Control 49:484\u2013492","journal-title":"Autom Remote Control"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:00:57Z","timestamp":1720692057000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":92,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_200","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}