Pages that link to "Item:Q4804168"
From MaRDI portal
The following pages link to An improved algorithm for the minmax regret median problem on a tree (Q4804168):
Displaying 25 items.
- Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
- On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
- A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687) (← links)
- Minmax regret location--allocation problem on a network under uncertainty (Q864020) (← 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)
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems (Q1027999) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
- Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← 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)
- On the minmax regret path median problem on trees (Q2353396) (← 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)
- Minimax regret path location on trees (Q3100694) (← links)
- Lexicographic<i>α</i>-robustness: an application to the 1-median problem (Q3561752) (← links)
- Minmax-regret robust 1-median location on a tree (Q4260015) (← links)
- Minmax Regret Median Location on a Network Under Uncertainty (Q4427324) (← links)
- The backup 2‐center and backup 2‐median problems on trees (Q5191127) (← links)
- Robust mean absolute deviation problems on networks with linear vertex weights (Q5326780) (← links)
- Location Science in Canada (Q6102878) (← links)
- Robust vertex centdian facility location problem on tree networks (Q6644380) (← links)
