Solving the generalized assignment problem : a hybrid Tabu search/branch and bound algorithm
The research reported in this thesis considers the classical combinatorial optimization problem known as the Generalized Assignment Problem (GAP). Since the mid 1970's researchers have been developing solution approaches for this particular type of problem due to its importance both in practica...
| Main Author: | |
|---|---|
| Published: |
Loughborough University
2007
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.492822 |