Pages that link to "Item:Q2892261"
From MaRDI portal
The following pages link to The Minmax Relative Regret Median Problem on Networks (Q2892261):
Displayed 4 items.
- Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
- Minimax regret path location on trees (Q3100694) (← links)
- Robust mean absolute deviation problems on networks with linear vertex weights (Q5326780) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)