The following pages link to (Q4605687):
Displaying 11 items.
- Complexity and in-approximability of a selection problem in robust optimization (Q385465) (← links)
- Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) (Q882651) (← links)
- On the formulation and solution of robust performance problems (Q1413929) (← links)
- Running time analysis of the (1+1)-EA for robust linear optimization (Q2003994) (← links)
- A dynamic programming approach for a class of robust optimization problems (Q2817842) (← links)
- Essential intersection and approximation results for robust optimization (Q2925036) (← links)
- (Q3183650) (← links)
- Robust optimization with applications to game theory (Q3643203) (← links)
- (Q5170933) (← links)
- Robust analysis and global optimization (Q5919267) (← links)
- Soft robust solutions to possibilistic optimization problems (Q6057607) (← links)
