A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch-and-bound algorithm

作者：Barketau M; Kopfer H; Pesch E^*

来源：Journal of the Operational Research Society, 2013, 64(11): 1614-1621.

DOI：10.1057/jors.2012.148

• lower bounds
• linear programming
• branch-and-bound algorithm
• Lagrangian relaxation

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.

• 出版日期2013-11