A Branch and Price Procedure for the Container Premarshalling Problem

DOI10.1007/978-3-662-44777-2_66zbMath1425.90063arXiv1406.7107OpenAlexW1558839344MaRDI QIDQ2921464

Ruben van der Zwaan, Martijn van Brink

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.7107

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (12)

An exact algorithm for the unrestricted block relocation problem ⋮ A biased random-key genetic algorithm for the container pre-marshalling problem ⋮ A beam search algorithm for minimizing crane times in premarshalling problems ⋮ A constraint programming approach for the premarshalling problem ⋮ A branch and bound approach for large pre-marshalling problems ⋮ Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm ⋮ Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem ⋮ A feasibility-based heuristic for the container pre-marshalling problem ⋮ Integer programming models for the pre-marshalling problem ⋮ A new effective unified model for solving the pre-marshalling and block relocation problems ⋮ An exact algorithm for the block relocation problem with a stowage plan ⋮ Deep learning assisted heuristic tree search for the container pre-marshalling problem

This page was built for publication: A Branch and Price Procedure for the Container Premarshalling Problem