Pages that link to "Item:Q439704"
From MaRDI portal
The following pages link to On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704):
Displayed 14 items.
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
- On scenario aggregation to approximate robust combinatorial optimization problems (Q1800442) (← links)
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs (Q1992893) (← links)
- Minimizing maximum cost for a single machine under uncertainty of processing times (Q2184134) (← links)
- Representative scenario construction and preprocessing for robust combinatorial optimization problems (Q2329662) (← links)
- A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
- Combinatorial optimization problems with balanced regret (Q2685694) (← links)
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)