{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T06:49:13Z","timestamp":1768546153714,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540562795","type":"print"},{"value":"9783540475019","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56279-6_88","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:57:57Z","timestamp":1330253877000},"page":"351-369","source":"Crossref","is-referenced-by-count":10,"title":["Generalized assignment problems"],"prefix":"10.1007","author":[{"given":"Silvano","family":"Martello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"G. Carpaneto, S. Martello, P. Toth (1988). Algorithms and codes for the assignment problem. In B. Simeone, P. Toth, G. Gallo, F. Maffioli, S. Pallottino (eds.). Fortran Codes For Network Optimization, Annals of Operations Research 13, 193\u2013223.","DOI":"10.1007\/BF02288323"},{"key":"37_CR2","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1287\/opre.19.6.1406","volume":"19","author":"A. Maio De","year":"1971","unstructured":"A. De Maio, C. Roveda (1971). An all zero-one algorithm for a certain class of transportation problems. Operations Research 19, 1406\u20131418.","journal-title":"Operations Research"},{"key":"37_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher (1981). The Lagrangian relaxation method for solving integer programming problems. Management Science 27, 1\u201318.","journal-title":"Management Science"},{"key":"37_CR4","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"M.L. Fisher","year":"1986","unstructured":"M.L. Fisher, R. Jaikumar, L.N. VanWassenhove (1986). A multiplier adjustment method for the generalized assignment problem. Management Science 32, 1095\u20131103.","journal-title":"Management Science"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01585725","volume":"46","author":"E.S. Gottlieb","year":"1990","unstructured":"E.S. Gottlieb, M.R. Rao (1990a). The generalized assignment problem: valid inequalities and facets. Mathematical Programming 46, 31\u201352.","journal-title":"Mathematical Programming"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01585726","volume":"46","author":"E.S. Gottlieb","year":"1990","unstructured":"E.S. Gottlieb, M.R. Rao (1990b). (1,k)-configuration facets for the generalized assignment problem. Mathematical Programming 46, 53\u201360.","journal-title":"Mathematical Programming"},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M.M. Guignard","year":"1987","unstructured":"M.M. Guignard, S. Kim (1987). Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Mathematical Programming 39, 215\u2013228.","journal-title":"Mathematical Programming"},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1287\/opre.37.4.658","volume":"37","author":"M.M. Guignard","year":"1989","unstructured":"M.M. Guignard, M.B. Rosenwein (1989). An improved dual based algorithm for the generalized assignment problem. Operations Research 37, 658\u2013663.","journal-title":"Operations Research"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0305-0548(79)90028-5","volume":"6","author":"T.D. Klastorin","year":"1979","unstructured":"T.D. Klastorin (1979). An effective subgradient algorithm for the generalized assignment problem. Computers and Operations Research 6, 155\u2013164.","journal-title":"Computers and Operations Research"},{"key":"37_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"N.W. Kuhn","year":"1955","unstructured":"N.W. Kuhn (1955). The hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 83\u201397.","journal-title":"Naval Research Logistics Quarterly"},{"key":"37_CR11","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler (1976). Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York."},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0377-2217(86)90328-0","volume":"27","author":"K. J\u00f6rnsten","year":"1986","unstructured":"K. J\u00f6rnsten, M. N\u00c4sberg (1986). A new Lagrangian relaxation approach to the generalized assignment problem. European Journal of Operational Research 27, 313\u2013323.","journal-title":"European Journal of Operational Research"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/0377-2217(80)90112-5","volume":"4","author":"S. Martello","year":"1980","unstructured":"S. Martello, P. Toth (1980). Solution of the zero-one multiple knapsack problem. European Journal of Operational Research 4, 276\u2013283.","journal-title":"European Journal of Operational Research"},{"key":"37_CR14","first-page":"589","volume-title":"Operational Research'81","author":"S. Martello","year":"1981","unstructured":"S. Martello, P. Toth (1981). An algorithm for the generalized assignment problem. In J.P. Brans (ed.), Operational Research'81, North-Holland, Amsterdam, 589\u2013603."},{"key":"37_CR15","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"S. Martello, P. Toth (1990). Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester."},{"key":"37_CR16","unstructured":"S. Martello, P. Toth (1991).The bottleneck generalized assignment problem. Research report DEIS OR\/5\/91, University of Bologna."},{"key":"37_CR17","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1287\/mnsc.35.8.923","volume":"35","author":"J.B. Mazzola","year":"1989","unstructured":"J.B. Mazzola (1989). Generalized assignment with nonlinear capacity interaction. Management Science 35, 923\u2013941.","journal-title":"Management Science"},{"key":"37_CR18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-188X(88)90053-5","volume":"14","author":"J.B. Mazzola","year":"1988","unstructured":"J.B. Mazzola, A.W. Neebe (1988). Bottleneck generalized assignment problems. Engineering Costs and Production Economics 14, 61\u201365.","journal-title":"Engineering Costs and Production Economics"},{"key":"37_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF01580430","volume":"8","author":"G.T. Ross","year":"1975","unstructured":"G.T. Ross, R.M. Soland (1975). A branch and bound algorithm for the generalized assignment problem. Mathematical Programming 8, 91\u2013103.","journal-title":"Mathematical Programming"},{"key":"37_CR20","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/opre.21.1.284","volume":"21","author":"V. Srinivasan","year":"1973","unstructured":"V. Srinivasan, G.L. Thompson (1973). An algorithm for assigning uses to sources in a special class of transportation problems. Operations Research 21, 284\u2013295.","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56279-6_88.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:48:52Z","timestamp":1619570932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56279-6_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562795","9783540475019"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-56279-6_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}