Pages that link to "Item:Q5487811"
From MaRDI portal
The following pages link to The bi‐criteria doubly weighted center‐median path problem on a tree (Q5487811):
Displaying 12 items.
- Range minimization problems in path-facility location on trees (Q713326) (← links)
- Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
- Extensive facility location problems on networks with equity measures (Q1028434) (← 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)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- An algorithm for solving the bi-objective median path-shaped facility on a tree network (Q2305157) (← links)
- Minimax regret path location on trees (Q3100694) (← links)
- The continuous and discrete path‐variance problems on trees (Q5191143) (← links)
