Pages that link to "Item:Q319447"
From MaRDI portal
The following pages link to A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447):
Displayed 15 items.
- Algorithms and uncertainty sets for data-driven robust shortest path problems (Q1634306) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- A double oracle approach to minmax regret optimization problems with interval data (Q1683128) (← links)
- Variable-sized uncertainty and inverse problems in robust optimization (Q1694311) (← links)
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
- On scenario aggregation to approximate robust combinatorial optimization problems (Q1800442) (← links)
- Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
- Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions (Q2224924) (← links)
- Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
- Generating hard instances for robust combinatorial optimization (Q2272296) (← links)
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
- A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558) (← links)
- Combinatorial optimization problems with balanced regret (Q2685694) (← links)
- Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees (Q6068703) (← links)
