-robust facility relocation problem
From MaRDI portal
Recommendations
- A decomposition approach for facility location and relocation problem with uncertain number of future facilities
- Dynamic-demand capacitated facility location problems with and without relocation
- Dynamic location problem under uncertainty with a regret‐based measure of robustness
- The α-reliable mean-excess regret model for stochastic facility location modeling
- α-Reliable p-minimax regret: A new model for strategic facility location modeling
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A decomposition approach for facility location and relocation problem with uncertain number of future facilities
- Budget constrained location problem with opening and closing of facilities.
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- Lagrangean decomposition for integer programming : theory and applications
- Minmax regret location--allocation problem on a network under uncertainty
- Strategic facility location: A review
- The Multiple-Choice Knapsack Problem
- The α-reliable mean-excess regret model for stochastic facility location modeling
- α-Reliable p-minimax regret: A new model for strategic facility location modeling
Cited in
(3)
This page was built for publication: \(\gamma\)-robust facility relocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355805)