Pages that link to "Item:Q2457271"
From MaRDI portal
The following pages link to On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271):
Displaying 8 items.
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
- Approximating Single Machine Scheduling with Scenarios (Q3541793) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
