Complexity results for storage loading problems with stacking constraints
From MaRDI portal
Publication:321101
DOI10.1016/j.ejor.2015.09.036zbMath1346.90483OpenAlexW1842409659WikidataQ57949121 ScholiaQ57949121MaRDI QIDQ321101
Natalia V. Shakhlevich, Florian Bruns, Sigrid Knust
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.09.036
Analysis of algorithms and problem complexity (68Q25) 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
Optimizing the number of deployed yard cranes in a container terminal, Smart stacking for import containers using customer information at automated container terminals, Robust storage loading problems with stacking and payload constraints, MIP-based approaches for robust storage loading problems with stacking constraints, Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation, Product packing and stacking under uncertainty: a robust approach, Solution approaches for storage loading problems with stacking constraints, The gain of robustness for a storage loading problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- A mathematical formulation and complexity considerations for the blocks relocation problem
- Online rules for container stacking
- Container ship stowage problem complexity and connection to the coloring of circle graphs
- Deriving decision rules to locate export containers in container yards
- A constraint programming model for fast optimal stowage of container vessel bays
- Positioning of loading units in a transshipment yard storage area
- Advanced methods for container stacking
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs