Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018)

DOI10.1016/J.EJOR.2020.12.041zbMath1487.90118OpenAlexW3116501250MaRDI QIDQ2030320

Bo Jin, Mingzhu Yu

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.041

zbMATH Keywords

dominance rulescontainer pre-marshalling problemmutual consistency

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (2)

Optimizing the number of deployed yard cranes in a container terminal ⋮ An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules

Cites Work

• An exact algorithm for the unrestricted block relocation problem
• Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
• An exact algorithm for the block relocation problem with a stowage plan
• A branch and bound approach for large pre-marshalling problems

This page was built for publication: Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018)