On the complexity of container stowage planning problems
From MaRDI portal
Publication:2449077
DOI10.1016/j.dam.2014.01.005zbMath1297.90144WikidataQ59406971 ScholiaQ59406971MaRDI QIDQ2449077
Kevin Tierney, Dario Pacino, Rune Møller Jensen
Publication date: 6 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.01.005
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
Related Items
An asymptotically optimal algorithm for online stacking, Uncertainty in maritime ship routing and scheduling: a literature review, Loading, unloading and premarshalling of stacks in storage areas: survey and classification, Robust storage loading problems with stacking and payload constraints, Scheduling cranes at an indented berth, A biased random-key genetic algorithm for the container pre-marshalling problem, An exact algorithm for the unrestricted block relocation problem, The pickup and delivery problem with time windows, multiple stacks, and handling operations, Integer linear programming models for the containership stowage problem, Matheuristics for slot planning of container vessel bays
Cites Work