Algorithms for central-median paths with bounded length on trees
From MaRDI portal
(Redirected from Publication:864041)
Recommendations
Cites work
- A linear algorithm for a core of a tree
- A polynomial algorithm for thep-centdian problem on a tree
- A review of extensive facility location in networks
- Algorithms for path medi-centers of a tree
- An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Conditional location of path and tree shaped facilities on trees
- Efficient Algorithms for Finding a Core of a Tree with a Specified Length
- Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Finding cores of limited length
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- Finding the \(\ell\)-core of a tree
- scientific article; zbMATH DE number 2081036 (Why is no real title available?)
- scientific article; zbMATH DE number 2081038 (Why is no real title available?)
- scientific article; zbMATH DE number 2090005 (Why is no real title available?)
- scientific article; zbMATH DE number 956792 (Why is no real title available?)
- scientific article; zbMATH DE number 961964 (Why is no real title available?)
- INDUCTIVE ALGORITHMS ON FINITE TREES
- Medi-Centers of a Tree
- On Locating a Facility to Service Areas within a Network
- On locating path- or tree-shaped facilities on networks
- The optimal location of a path or tree in a tree network
Cited in
(23)- Extensive facility location problems on networks with equity measures
- \((r,p)\)-centroid problems on paths and trees
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- Extensive facility location problems on networks: an updated review
- An improved algorithm for the minmax regret path centdian problem on trees
- Algorithms for path medi-centers of a tree
- On the location of a constrained k-tree facility in a tree network with unreliable edges
- An algorithm for solving the bi-objective median path-shaped facility on a tree network
- On the minmax regret path median problem on trees
- Two paths location of a tree with positive or negative weights
- Minimax regret path location on trees
- The connected \(p\)-centdian problem on block graphs
- The bi-criteria doubly weighted center-median path problem on a tree
- On locating a single path-like facility in a general graph
- scientific article; zbMATH DE number 2081036 (Why is no real title available?)
- scientific article; zbMATH DE number 2090005 (Why is no real title available?)
- The continuous and discrete path‐variance problems on trees
- The bi‐criteria doubly weighted center‐median path problem on a tree
- Range minimization problems in path-facility location on trees
- Algorithms for connected \(p\)-centdian problem on block graphs
- Two paths location of a tree with positive or negative weights
- Comparing different metaheuristic approaches for the median path problem with bounded length
- Finding the conditional location of a median path on a tree
This page was built for publication: Algorithms for central-median paths with bounded length on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864041)
