Pages that link to "Item:Q864041"
From MaRDI portal
The following pages link to Algorithms for central-median paths with bounded length on trees (Q864041):
Displaying 16 items.
- Range minimization problems in path-facility location on trees (Q713326) (← links)
- Algorithms for connected \(p\)-centdian problem on block graphs (Q724753) (← links)
- Two paths location of a tree with positive or negative weights (Q896109) (← links)
- Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
- Finding the conditional location of a median path on a tree (Q937298) (← 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)
- On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges (Q2294142) (← links)
- An algorithm for solving the bi-objective median path-shaped facility on a tree network (Q2305157) (← links)
- On the minmax regret path median problem on trees (Q2353396) (← links)
- Two Paths Location of a Tree with Positive or Negative Weights (Q2942409) (← links)
- Minimax regret path location on trees (Q3100694) (← links)
- The Connected p-Centdian Problem on Block Graphs (Q3467867) (← links)
- The continuous and discrete path‐variance problems on trees (Q5191143) (← links)
