Abstract
A hybrid algorithm for the generalized assignment problem is presented. The algorithm is based on the generation of valid inequalities from single knapsack constraints and a generalized branch and bound scheme. The pivot and complement heuristic, together with fathoming tests, are also carried out during the solution procedure. Computational results are presented from 5 test problems of size 100 0/1-variables.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
