Pages that link to "Item:Q2162527"
From MaRDI portal
The following pages link to Robust min-max regret covering problems (Q2162527):
Displaying 11 items.
- The robust set covering problem with interval data (Q367647) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Set coverage and robust policy (Q433183) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
- Formulation and algorithms for the robust maximal covering location problem (Q1742214) (← links)
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
- On minimax robustness: A general approach and applications (Q3335644) (← links)
- Thresholded Covering Algorithms for Robust and Max-min Optimization (Q3587385) (← links)
- (Q4954938) (← links)
- On the complexity of robust multi-stage problems with discrete recourse (Q6180695) (← links)