| Article ID: | iaor19981368 |
| Country: | Netherlands |
| Volume: | 83 |
| Issue: | 3 |
| Start Page Number: | 711 |
| End Page Number: | 712 |
| Publication Date: | Jun 1995 |
| Journal: | European Journal of Operational Research |
| Authors: | Martello Silvano, Toth Paolo |
| Keywords: | programming: branch and bound |
We give a computational comparison between the algorithms of Mazzola–Neebe and Martello–Toth for the bottleneck generalized assignment problem.