The gain of robustness for a storage loading problem
From MaRDI portal
Publication:2054669
DOI10.1007/s10013-020-00425-zzbMath1478.90006OpenAlexW3041447034MaRDI QIDQ2054669
Sigrid Knust, Xuan Thanh Le, Nguyen Thi Nga
Publication date: 3 December 2021
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10013-020-00425-z
Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Uses Software
Cites Work
- Unnamed Item
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- The parallel stack loading problem to minimize blockages
- Complexity results for storage loading problems with stacking constraints
- Robust storage loading problems with stacking and payload constraints
- Robust load planning of trains in intermodal transportation
- Robust discrete optimization and network flows
- Deriving decision rules to locate export containers in container yards
- 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
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
- Theory and Applications of Robust Optimization
- The Price of Robustness