Dang, Thu and Durrell, Lauren and Letchford, Adam (2026) An application of semi-Lagrangian relaxation to the generalised assignment problem. Operations Research Letters. ISSN 0167-6377 (In Press)
![[thumbnail of gap]](https://eprints.lancs.ac.uk/style/images/fileicons/text.png)
Text (gap)
gap.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (422kB)
gap.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (422kB)
Abstract
The Generalised Assignment Problem is a fundamental and much studied combinatorial optimisation problem, with many applications. We present a new exact algorithm for the problem, based on semi-Lagrangian relaxation. The algorithm managed to solve 3 instances that had previously remained unsolved, and yielded very strong lower bounds for many other instances. Oddly, however, the algorithm per formed poorly for some instances.
Item Type:
Journal Article
Journal or Publication Title:
Operations Research Letters
Uncontrolled Keywords:
Research Output Funding/yes_externally_funded
Subjects:
?? combinatorial optimisationlagrangian relaxationgeneralised assignment problemyes - externally fundedmanagement science and operations researchsoftwareapplied mathematicsindustrial and manufacturing engineering ??
Departments:
ID Code:
236038
Deposited By:
Deposited On:
18 Mar 2026 13:20
Refereed?:
Yes
Published?:
In Press
Last Modified:
21 Mar 2026 00:11