39
Views
3
CrossRef citations to date
0
Altmetric
General Paper

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

, &
Pages 1614-1621 | Received 01 Apr 2012, Accepted 01 Oct 2012, Published online: 21 Dec 2017

References

  • BontekoningYMMacharisCTripJJIs a new applied transportation research field emerging? A review of intermodal rail-truck freight transport literatureTransportation Research Part A: Policy and Practice200438113410.1016/S0191-2615(02)00074-7
  • BoysenNJaehnFPeschEScheduling freight trains in rail–rail transshipment yardsTransportation Science201145219921110.1287/trsc.1100.0365
  • Boysen N, Fliedner M, Jaehn F and Pesch E (2012a). A survey on container processing in railway yards. Transportation Science doi:10.1287/trsc.1120.0415.
  • BoysenNJaehnFPeschENew bounds and algorithms for the transshipment yard scheduling problemJournal of Scheduling201215449951110.1007/s10951-010-0200-2
  • CordeauJFTothPVigoDA survey of optimization models for train routing and schedulingTransportation Science199832438040410.1287/trsc.32.4.380
  • CrainicTGKimKHIntermodal transportationHandbooks in Operations Research and Management Science 142007467537
  • FischettiMTothPAn additive bounding procedure for combinatorial optimization problemsOperations Research198937231932810.1287/opre.37.2.319
  • FisherMLA dual algorithm for the one-machine scheduling problemMathematical Programming197611122925110.1007/BF01580393
  • HoogeveenJAvan de VeldeSLStronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problemsMathematical Programming1995701-317319010.1007/BF01585935
  • MacharisCBontekoningYMOpportunities for OR in intermodal freight transport research: A reviewEuropean Journal of Operational Research2004153240041610.1016/S0377-2217(03)00161-9
  • van de VeldeSLDual decomposition of a single-machine scheduling problemMathematical Programming1995693413428

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.