The following pages link to (Q4367277):
Displaying 11 items.
- Range minimization problems in path-facility location on trees (Q713326) (← links)
- The nestedness property of the convex ordered median location problem on a tree (Q783030) (← links)
- Extensive facility location problems on networks with equity measures (Q1028434) (← links)
- Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869) (← links)
- The centdian subtree on tree networks (Q1602695) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- The continuous and discrete path‐variance problems on trees (Q5191143) (← links)
- The extensive 1-median problem with radius on networks (Q6091088) (← links)
