Pages that link to "Item:Q3703613"
From MaRDI portal
The following pages link to The optimal location of a path or tree in a tree network (Q3703613):
Displaying 48 items.
- A note on the nestedness property for ordered median problems in tree networks (Q394466) (← links)
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- The path-variance problem on tree networks (Q705500) (← links)
- The nestedness property of the convex ordered median location problem on a tree (Q783030) (← links)
- Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
- A minimum length covering subgraph of a network (Q920001) (← 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)
- A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree (Q987822) (← links)
- Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869) (← links)
- The location of central structures in trees (Q1097827) (← links)
- Group centre and group median of a network (Q1123113) (← links)
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784) (← links)
- A review of extensive facility location in networks (Q1278421) (← links)
- Location of paths on trees with minimal eccentricity and superior section (Q1284599) (← links)
- A unifying location model on tree graphs based on submodularity property (Q1314341) (← links)
- Finding the \(\ell\)-core of a tree (Q1348250) (← links)
- The centdian subtree on tree networks (Q1602695) (← 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)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Group centre and group median of a tree (Q1804070) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees (Q1942273) (← 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)
- On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges (Q2294142) (← links)
- On the minmax regret path median problem on trees (Q2353396) (← links)
- A note on the subtree ordered median problem in networks based on nestedness property (Q2358843) (← links)
- The location of median paths on grid graphs (Q2480201) (← links)
- A branch-and-cut algorithm for the median-path problem (Q2490367) (← links)
- Hyperpath Centers (Q2955915) (← links)
- Locating median paths on connected outerplanar graphs (Q3008924) (← links)
- Least central subtrees, center, and centroid of a tree (Q3087617) (← links)
- Minimax regret path location on trees (Q3100694) (← links)
- On locating path- or tree-shaped facilities on networks (Q3141111) (← links)
- An Axiomatic Approach to Location on Networks (Q3202132) (← links)
- Optimal location of a path or tree on a network with cycles (Q3202133) (← links)
- Core and Conditional Core Path of Specified Length in Special Classes of Graphs (Q3605503) (← links)
- Parametric Facility Location on a Tree Network with an <i>L</i><sub><i>p</i></sub>-Norm Cost Function (Q3787758) (← links)
- (Q3813624) (← links)
- On a tree-shaped facility location problem of Minieka (Q4021818) (← links)
- THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK (Q4819980) (← links)
- Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network (Q4943071) (← links)
- Finding cores of limited length (Q5096925) (← links)
- On fixed-parameter solvability of the minimax path location problem (Q6063573) (← links)