MIP-based approaches for robust storage loading problems with stacking constraints
DOI10.1016/j.cor.2016.08.016zbMath1391.90433OpenAlexW2514718768MaRDI QIDQ1652064
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.08.016
mixed integer linear programmingstacking constraintsstorage loadingadjustable robustnessstrict robustness
Mixed integer programming (90C11) Sensitivity, stability, parametric optimization (90C31) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (6)
Uses Software
Cites Work
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- Complexity results for storage loading problems with stacking constraints
- Robust storage loading problems with stacking and payload constraints
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Robust load planning of trains in intermodal transportation
- Robust discrete optimization and its applications
- Adjustable robust solutions of uncertain linear programs
- Deriving decision rules to locate export containers in container yards
- A robust optimization approach to wine grape harvesting scheduling
- Robust Convex Optimization
- An Empirical Analysis of Robustness Concepts for Timetabling
- The Price of Robustness
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Robust Optimization for Empty Repositioning Problems
- Benchmarking optimization software with performance profiles.
- Unnamed Item
This page was built for publication: MIP-based approaches for robust storage loading problems with stacking constraints