publication . Article . 2013

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

M Barketau; H Kopfer; E Pesch;
Open Access
  • Published: 01 Jan 2013 Journal: Journal of the Operational Research Society, volume 64, issue 11 November, pages 1,614-1,621
Abstract
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.
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue