Pages that link to "Item:Q2462558"
From MaRDI portal
The following pages link to Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization (Q2462558):
Displaying 9 items.
- Min-max regret robust optimization approach on interval data uncertainty (Q946180) (← links)
- Robust supply chain network design: an optimization model with real world application (Q1699156) (← links)
- Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria (Q1926791) (← links)
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- Recent advances in robust optimization: an overview (Q2256312) (← links)
- Approximate cutting plane approaches for exact solutions to robust optimization problems (Q2301927) (← links)
- A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity (Q3638501) (← links)
- Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems (Q5058052) (← links)
- Home health care facility location problem under demand uncertainty (Q6620392) (← links)
