| Article ID: | iaor20135346 |
| Volume: | 64 |
| Issue: | 11 |
| Start Page Number: | 1614 |
| End Page Number: | 1621 |
| Publication Date: | Nov 2013 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Kopfer H, Barketau M, Pesch E |
| Keywords: | programming: branch and bound |
In this paper, we consider the container transshipment problem at a railway hub. A simple lower bound known for this problem will be improved by a new Lagrangian relaxation lower bound. Computational tests show that this lower bound outperforms the simple one and decreases substantially the run time of the branch‐and‐bound algorithm.