Pages that link to "Item:Q429650"
From MaRDI portal
The following pages link to General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650):
Displaying 13 items.
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
- Using the WOWA operator in robust discrete optimization problems (Q895514) (← links)
- An improved genetic algorithm for single-machine inverse scheduling problem (Q1718215) (← links)
- A unified approach to uncertain optimization (Q1753451) (← links)
- Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
- Complexity of the robust weighted independent set problems on interval graphs (Q2018858) (← links)
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion (Q2189877) (← links)
- Proportional and maxmin fairness for the sensor location problem with chance constraints (Q2414477) (← links)
- Robust Discrete Optimization Problems with the WOWA Criterion (Q2806941) (← links)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
- Min‐Max quickest path problems (Q5326774) (← links)
- Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective (Q6113355) (← links)
