Pages that link to "Item:Q1698883"
From MaRDI portal
The following pages link to Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883):
Displaying 13 items.
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- Minmax regret solutions for minimax optimization problems with uncertainty (Q1591541) (← links)
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← links)
- Variable-sized uncertainty and inverse problems in robust optimization (Q1694311) (← links)
- Project net present value estimation under uncertainty (Q1725833) (← links)
- Robust combinatorial optimization under budgeted-ellipsoidal uncertainty (Q1731817) (← links)
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (Q1750469) (← links)
- The impacts of retailers' regret aversion on a random multi-period supply chain network (Q2086940) (← links)
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
- Combinatorial optimization problems with balanced regret (Q2685694) (← links)
- A Probabilistic Model for Minmax Regret in Combinatorial Optimization (Q5166306) (← links)
- Benchmarking problems for robust discrete optimization (Q6568403) (← links)
