Algorithms for central-median paths with bounded length on trees

DOI10.1016/J.EJOR.2005.09.049zbMATH Open1127.90043OpenAlexW2061620935MaRDI QIDQ864041FDOQ864041

Authors: Ronald I. Becker, Isabella Lari, 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

Recommendations

• Algorithms for path medi-centers of a tree
• scientific article; zbMATH DE number 2090005
• Finding the conditional location of a median path on a tree
• Range minimization problems in path-facility location on trees
• Conditional location of path and tree shaped facilities on trees

zbMATH Keywords

facility locationcentral pathmedian path

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

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

Cited In (22)

• Title not available (Why is that?)
• On the minmax regret path median problem on trees
• The continuous and discrete path‐variance problems on trees
• Title not available (Why is that?)
• The Connected p-Centdian Problem on Block Graphs
• The bi‐criteria doubly weighted center‐median path problem on a tree
• Extensive facility location problems on networks: an updated review
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• Algorithms for connected \(p\)-centdian problem on block graphs
• Extensive facility location problems on networks with equity measures
• Minimax regret path location on trees
• Two Paths Location of a Tree with Positive or Negative Weights
• Algorithms for path medi-centers of a tree
• Two paths location of a tree with positive or negative weights
• The bi-criteria doubly weighted center-median path problem on a tree
• Range minimization problems in path-facility location on trees
• On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges
• Comparing different metaheuristic approaches for the median path problem with bounded length
• \((r,p)\)-centroid problems on paths and trees
• An algorithm for solving the bi-objective median path-shaped facility on a tree network
• Finding the conditional location of a median path on a tree
• An improved algorithm for the minmax regret path centdian problem on trees

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)