Pages that link to "Item:Q1014933"
From MaRDI portal
The following pages link to Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933):
Displaying 4 items.
- An integrated approach for planning a long-term care network with uncertainty, strategic policy and equity considerations (Q319978) (← links)
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
