Pages that link to "Item:Q2892261"
From MaRDI portal
The following pages link to The minmax relative regret median problem on networks (Q2892261):
Displaying 9 items.
- A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
- Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
- Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
- Minimax regret single-facility ordered median location problems on networks (Q2901048) (← links)
- Minimax regret path location on trees (Q3100694) (← links)
- Minimax regret p-center location on a network with demand uncertainty (Q4228787) (← links)
- Minmax Regret Median Location on a Network Under Uncertainty (Q4427324) (← links)
- Robust mean absolute deviation problems on networks with linear vertex weights (Q5326780) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)
