Algorithms for central-median paths with bounded length on trees

DOI10.1016/j.ejor.2005.09.049zbMath1127.90043OpenAlexW2061620935MaRDI QIDQ864041

Isabella Lari, Ronald I. Becker, Andrea Scozzari

Publication date: 12 February 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.049

zbMATH Keywords

facility locationcentral pathmedian path

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, The Connected p-Centdian Problem on Block Graphs, Extensive facility location problems on networks: an updated review, An improved algorithm for the minmax regret path centdian problem on trees, Two Paths Location of a Tree with Positive or Negative Weights, 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, Range minimization problems in path-facility location on trees, The continuous and discrete path‐variance problems on trees, Algorithms for connected \(p\)-centdian problem on block graphs, 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, Extensive facility location problems on networks with equity measures, Minimax regret path location on trees, On the minmax regret path median problem on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A review of extensive facility location in networks
• Finding the \(\ell\)-core of a tree
• Algorithms for path medi-centers of a tree
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• On locating path- or tree-shaped facilities on networks
• INDUCTIVE ALGORITHMS ON FINITE TREES
• The optimal location of a path or tree in a tree network
• Medi-Centers of a Tree
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A linear algorithm for a core of a tree
• On Locating a Facility to Service Areas within a Network
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• A polynomial algorithm for thep-centdian problem on a tree
• 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
• Finding cores of limited length
• Conditional location of path and tree shaped facilities on trees