Pages that link to "Item:Q2353396"
From MaRDI portal
The following pages link to On the minmax regret path median problem on trees (Q2353396):
Displaying 14 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)
- On the minmax regret path center problem on trees (Q777269) (← links)
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (Q924878) (← links)
- A note on the minmax regret centdian location on trees (Q935247) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← 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 Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree (Q2914306) (← links)
- Minimax regret path location on trees (Q3100694) (← links)
- Robust reverse 1-center problems on trees with interval costs (Q6661114) (← links)
