| Article ID: | iaor19911716 |
| Country: | Germany |
| Volume: | 22 |
| Start Page Number: | 273 |
| End Page Number: | 282 |
| Publication Date: | Feb 1991 |
| Journal: | Optimization |
| Authors: | Jrnsten K.O., Vrbrand P. |
| Keywords: | programming: integer |
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.