Pages that link to "Item:Q486974"
From MaRDI portal
The following pages link to A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974):
Displaying 16 items.
- Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (Q924878) (← links)
- An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees (Q976129) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
- A minmax regret median problem on a tree under uncertain locations of the demand points (Q2450737) (← links)
- The minmax relative regret median problem on networks (Q2892261) (← links)
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree (Q2914306) (← links)
- Minmax-regret robust 1-median location on a tree (Q4260015) (← links)
- Minmax Regret Median Location on a Network Under Uncertainty (Q4427324) (← links)
- An improved algorithm for the minmax regret median problem on a tree (Q4804168) (← links)
- Robust reverse 1-center problems on trees with interval costs (Q6661114) (← links)
