{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T22:08:45Z","timestamp":1776118125153,"version":"3.50.1"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.orl.2026.107442","type":"journal-article","created":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T23:01:24Z","timestamp":1774220484000},"page":"107442","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An application of semi-Lagrangian relaxation to the generalised assignment problem"],"prefix":"10.1016","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2184-191X","authenticated-orcid":false,"given":"Thu Huong","family":"Dang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0349-4595","authenticated-orcid":false,"given":"Lauren","family":"Durrell","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3191-5006","authenticated-orcid":false,"given":"Adam N.","family":"Letchford","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2026.107442_bib0001","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","article-title":"A branch and bound algorithm for the generalized assignment problem","volume":"8","author":"Ross","year":"1975","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2026.107442_bib0002","first-page":"123","article-title":"A survey of the generalized assignment problem and its applications","volume":"45","author":"\u00d6ncan","year":"2007","journal-title":"INFOR"},{"key":"10.1016\/j.orl.2026.107442_bib0003","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-Complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/j.orl.2026.107442_bib0004","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/j.orl.2026.107442_bib0005","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","article-title":"A survey of algorithms for the generalized assignment problem","volume":"60","author":"Cattrysse","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.orl.2026.107442_bib0006","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/j.orl.2026.107442_bib0007","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","article-title":"A multiplier adjustment method for the generalized assignment problem","volume":"32","author":"Fisher","year":"1986","journal-title":"Manag. Sci."},{"key":"10.1016\/j.orl.2026.107442_bib0008","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1287\/opre.37.4.658","article-title":"An improved dual based algorithm for the generalized assignment problem","volume":"37","author":"Guignard","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2026.107442_bib0009","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0377-2217(86)90328-0","article-title":"A new lagrangian relaxation approach to the generalized assignment problem","volume":"27","author":"J\u00f6rnsten","year":"1986","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.orl.2026.107442_bib0010","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1287\/ijoc.15.3.249.16075","article-title":"Solving the generalized assignment problem: an optimizing and heuristic approach","volume":"15","author":"Nauss","year":"2003","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.orl.2026.107442_bib0011","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10589-011-9432-0","article-title":"An exact method with variable fixing for solving the generalized assignment problem","volume":"52","author":"Posta","year":"2012","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.orl.2026.107442_bib0012","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10589-006-6513-6","article-title":"Solving the p-median problem with a semi-lagrangian relaxation","volume":"35","author":"Beltr\u00e1n-Royo","year":"2006","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.orl.2026.107442_bib0013","first-page":"75","article-title":"A new semi-lagrangean relaxation for the k-cardinality assignment problem","volume":"37","author":"Belik","year":"2016","journal-title":"J. Infor. Optim. Sci."},{"key":"10.1016\/j.orl.2026.107442_bib0014","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10589-010-9338-2","article-title":"Semi-lagrangian relaxation applied to the uncapacitated facility location problem","volume":"51","author":"Beltr\u00e1n-Royo","year":"2012","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.orl.2026.107442_bib0015","doi-asserted-by":"crossref","first-page":"2391","DOI":"10.1080\/01605682.2022.2150573","article-title":"A semi-lagrangian relaxation heuristic algorithm for the simple plant location problem with order","volume":"74","author":"Cabezas","year":"2023","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.orl.2026.107442_bib0016","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.21629\/JSEE.2016.05.14","article-title":"Solution to the quadratic assignment problem using semi-lagrangian relaxation","volume":"27","author":"Zhang","year":"2016","journal-title":"J. Syst. Eng. Electron."},{"key":"10.1016\/j.orl.2026.107442_bib0017","series-title":"Integer Programming","author":"Wolsey","year":"2020"},{"key":"10.1016\/j.orl.2026.107442_bib0018","series-title":"Combinatorial Optimization: Theory and Algorithms","author":"Korte","year":"2018"},{"key":"10.1016\/j.orl.2026.107442_bib0019","first-page":"151","article-title":"Lagrangian relaxation","volume":"11","author":"Guignard","year":"2003","journal-title":"Trabajos de Operativa (TOP)"},{"key":"10.1016\/j.orl.2026.107442_bib0020","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/S0377-2217(97)00054-4","article-title":"Solving the generalized assignment problem using polyhedral results","volume":"108","author":"Cattrysse","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.orl.2026.107442_bib0021","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","article-title":"A branch-and-price algorithm for the generalized assignment problem","volume":"45","author":"Savelsbergh","year":"1997","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2026.107442_bib0022","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.orl.2026.107442_bib0023","article-title":"Knapsack problems\u2014an overview of recent advances. part i: single knapsack problems","volume":"143","author":"Cacchiani","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.orl.2026.107442_bib0024","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/ijoc.2018.0822","article-title":"Primal heuristics for branch and price: the assets of diving methods","volume":"31","author":"Sadykov","year":"2019","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.orl.2026.107442_bib0025","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10589-008-9183-8","article-title":"A computational study of exact knapsack separation for the generalized assignment problem","volume":"45","author":"Avella","year":"2010","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.orl.2026.107442_bib0026","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/1520-6750(199203)39:2<137::AID-NAV3220390202>3.0.CO;2-D","article-title":"A linear relaxation heuristic for the generalized assignment problem","volume":"39","author":"Trick","year":"1992","journal-title":"Nav. Res. Logist."},{"key":"10.1016\/j.orl.2026.107442_bib0027","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01585725","article-title":"The generalized assignment problem: valid inequalities and facets","volume":"46","author":"Gottlieb","year":"1990","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2026.107442_bib0028","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01720977","article-title":"Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches","volume":"17","author":"Osman","year":"1995","journal-title":"Oper. Res. Spektrum"},{"key":"10.1016\/j.orl.2026.107442_bib0029","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(94)90338-7","article-title":"A set partitioning heuristic for the generalized assignment problem","volume":"72","author":"Cattrysse","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.orl.2026.107442_bib0030","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0305-0548(96)00032-9","article-title":"A genetic algorithm for the generalised assignment problem","volume":"24","author":"Chu","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.orl.2026.107442_bib0031","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.ejor.2004.08.015","article-title":"A path relinking approach with ejection chains for the generalized assignment problem","volume":"169","author":"Yagiura","year":"2006","journal-title":"Eur. J. Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000398?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000398?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T21:34:23Z","timestamp":1776116063000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637726000398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":31,"alternative-id":["S0167637726000398"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2026.107442","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An application of semi-Lagrangian relaxation to the generalised assignment problem","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2026.107442","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107442"}}