{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T03:48:47Z","timestamp":1780631327865,"version":"3.54.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,6,22]],"date-time":"2006-06-22T00:00:00Z","timestamp":1150934400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10479-006-0048-1","type":"journal-article","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T17:29:41Z","timestamp":1150910981000},"page":"91-104","source":"Crossref","is-referenced-by-count":18,"title":["LP based heuristics for the multiple knapsack problem with assignment restrictions"],"prefix":"10.1007","volume":"146","author":[{"given":"Geir","family":"Dahl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nj\u00e5l","family":"Foldnes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,6,22]]},"reference":[{"issue":"1","key":"48_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01582131","volume":"80","author":"D. Bertsimas","year":"1998","unstructured":"Bertsimas, D. and R. Vohra. (1998). \u201cRounding algorithms for covering problems. \u201cMathematical Programming.\u201d 80(1), 63.","journal-title":"Mathematical Programming"},{"key":"48_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1009894503716","volume":"4","author":"M. Dawande","year":"2000","unstructured":"Dawande, M., J. Kalagnanam, P. Keskinocak, R. Ravi and F.S. Salman. (2000). \u201cApproximation algorithms for the multiple knapsack problem with assignment restrictions,\u201d Journal of Combinatorial Optimization, 4, 171\u2013186.","journal-title":"Journal of Combinatorial Optimization"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Glover, F (1967). \u201cMaximum matching in a convex bipartite graph.\u201d Naval research logistics quarterly.","DOI":"10.1002\/nav.3800140304"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Ferreira, C.E., A. Martin and R. Weismantel. (1996). \u201cSolving multiple knapsack problems by cutting planes\u201d SIAM J. Optimization, Vol.6, No.3, pp. 858\u2013877.","DOI":"10.1137\/S1052623493254455"},{"key":"48_CR5","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(98)00120-9","volume":"114","author":"D. Pisinger","year":"1999","unstructured":"Pisinger, D. (1999).\u201cAn Exact Algorithm for Large Multiple Knapsack Problems.\u201d European Journal of Operational Research, 114, 528\u2013541.","journal-title":"European Journal of Operational Research"},{"key":"48_CR6","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. New York:John Wiley."},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Caprara, A., H. Kellerer and U. Pferschy. (2000). \u201cA PTAS for the Multiple Subset Sum Problem with different knapsack capacities.\u201d Information Processing Letters, 73, 111\u2013118.","DOI":"10.1016\/S0020-0190(00)00010-7"},{"key":"48_CR8","unstructured":"Srinivasan, A. (1999). \u201cApproximation Algorithms Via Randomized Rounding: A survey.\u201d In M. Karonski and H.J. Promel. (eds.), Lectures on Approximation and Randomized Algorithms. Series in Advanced Topics in Mathematics. Polish Scientific Publishers PWN, Warszawa, pp. 9\u201371."},{"key":"48_CR9","unstructured":"CPLEX Optimization, Inc."},{"key":"48_CR10","unstructured":"Garey, M.R. and D.S. Johnson (1979). Computers and Intractability: A Guide to NP-Completeness. WH Freeman."},{"key":"48_CR11","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1995","unstructured":"Billingsley, P. (1995). Probability and Measure. New York: Wiley."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0048-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-006-0048-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0048-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:32Z","timestamp":1559153252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-006-0048-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,22]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["48"],"URL":"https:\/\/doi.org\/10.1007\/s10479-006-0048-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,22]]}}}