{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:05:21Z","timestamp":1747652721034},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bf00132501","type":"journal-article","created":{"date-parts":[[2004,11,4]],"date-time":"2004-11-04T04:15:04Z","timestamp":1099541704000},"page":"303-311","source":"Crossref","is-referenced-by-count":11,"title":["A simple dual algorithm for the generalised assignment problem"],"prefix":"10.1007","volume":"2","author":[{"given":"John M.","family":"Wilson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1287\/mnsc.40.7.868","volume":"40","author":"M.M. Amini","year":"1994","unstructured":"Amini, M.M. and M.Racer. (1994). ?A Rigorous Comparison of Alternative Solution Methods for the Generalized Assignment Problem,? Management Science 40, 868?890.","journal-title":"Management Science"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"M.L. Fisher","year":"1986","unstructured":"Fisher, M.L., R.Jaikumar and L.N.VanWassenhove. (1986). ?A Multiplier Adjustment Method for the Generalized Assignment Problem,? Management Science 32, 1095?1103.","journal-title":"Management Science"},{"key":"CR3","unstructured":"Foulds, L.R. and J.M. Wilson. (1994). ?A Variation on the Generalized Assignment Problem Arising in the New Zealand Dairy Industry.? Working paper, Loughborough University Business School. To appear in Annals of Operations Research."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1287\/opre.37.4.658","volume":"37","author":"M.M. Guignard","year":"1989","unstructured":"Guignard, M.M. and M.B.Rosenwein. (1989). ?An Improved Dual Based Algorithm for the Generalized Assignment Problem,? Operations Research 37, 658?663.","journal-title":"Operations Research"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","volume":"82","author":"M. Laguna","year":"1995","unstructured":"Laguna, M., J.P.Kelly, J.L.Gonzalez-Velarde, and F.Glover. (1995). ?Tabu Search for the Multilevel Generalized Assignment Problem,? European Journal of Operational Research 82, 176?189.","journal-title":"European Journal of Operational Research"},{"key":"CR6","first-page":"589","volume-title":"Operational Research '81","author":"S. Martello","year":"1981","unstructured":"Martello, S. and P.Toth. (1981). ?An Algorithm for the Generalized Assignment Problem.? In J.P.Brans (Ed.), Operational Research '81, 589?603, North-Holland, Amsterdam."},{"key":"CR7","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S. and P.Toth. (1990). Knapsack Problems: Algorithms and Computer Implementations. Chichester: John Wiley and Sons."},{"key":"CR8","series-title":"Working Paper","volume-title":"A Comparison of Heuristics for the Generalised Assignment Problem","author":"I.H. Osman","year":"1990","unstructured":"Osman, I.H. (1990). ?A Comparison of Heuristics for the Generalised Assignment Problem.? Working Paper, Institute of Mathematics and Statistics, University of Kent, Kent, England."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01720977","volume":"17","author":"I.H. Osman","year":"1995","unstructured":"Osman, I.H. (1995). ?Heuristics for the Generalised Assignment Problem: Simulated Annealing and Tabu Search Approaches,? OR Spektrum 17, 211?225.","journal-title":"OR Spektrum"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","volume":"8","author":"G.T. Ross","year":"1975","unstructured":"Ross, G.T. and P.M.Soland. (1975). ?A Branch and Bound Based Algorithm for the Generalized Assignment Problem,? Mathematical Programming 8, 91?103.","journal-title":"Mathematical Programming"},{"key":"CR11","unstructured":"Sciconic\/VM. EDS-Scicon, Wavendon Tower, Milton Keynes, Bedfordshire, England."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00132501.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00132501\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00132501","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T10:22:31Z","timestamp":1554286951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00132501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997]]}},"alternative-id":["BF00132501"],"URL":"https:\/\/doi.org\/10.1007\/bf00132501","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}