Pages that link to "Item:Q1634058"
From MaRDI portal
The following pages link to Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058):
Displaying 8 items.
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty (Q723948) (← links)
- Minmax regret combinatorial optimization problems with investments (Q1652341) (← links)
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
- On scenario aggregation to approximate robust combinatorial optimization problems (Q1800442) (← links)
- Robust optimization strategies for seller based on uncertainty sets in context of sequential auction (Q2660835) (← links)
- Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)
- Combinatorial optimization problems with balanced regret (Q2685694) (← links)
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)