Pages that link to "Item:Q1827805"
From MaRDI portal
The following pages link to Interval data minmax regret network optimization problems (Q1827805):
Displayed 7 items.
- Optimization under Decision-Dependent Uncertainty (Q4571878) (← links)
- Risk Averse Shortest Paths: A Computational Study (Q5136079) (← links)
- Robust mean absolute deviation problems on networks with linear vertex weights (Q5326780) (← links)
- On a Class of Interval Data Minmax Regret CO Problems (Q5391890) (← links)
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality (Q5448654) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)