Range minimization problems in path-facility location on trees

DOI10.1016/j.dam.2012.05.020zbMath1250.90103OpenAlexW1990080641WikidataQ58217175 ScholiaQ58217175MaRDI QIDQ713326

Andrea Scozzari, Federica Ricca, Justo Puerto

Publication date: 26 October 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.05.020

zbMATH Keywords

range criterionequity measureslength constraintpath location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (4)

Unreliable point facility location problems on networks ⋮ Extensive facility location problems on networks: an updated review ⋮ Location of speed-up subnetworks ⋮ Reliability problems in multiple path-shaped facility location on networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lagrangean bounds for the optimum communication spanning tree problem
• The ordered capacitated facility location problem
• Conditional median as a robust solution concept for uncapacitated location problems
• The path-variance problem on tree networks
• Algorithms for central-median paths with bounded length on trees
• Extensive facility location problems on networks with equity measures
• Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
• A review of extensive facility location in networks
• Equity measurement in facility location analysis: A review and framework
• Improved algorithms for several network location problems with equality measures.
• Sorting weighted distances with applications to objective function evaluations in single facility location problems.
• The centdian subtree on tree networks
• Locating tree-shaped facilities using the ordered median objective
• Algorithms for path medi-centers of a tree
• Locating median paths on connected outerplanar graphs
• On locating path- or tree-shaped facilities on networks
• An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• Finding kth paths and p-centers by generating and searching good data structures
• The continuous and discrete path‐variance problems on trees
• Conditional location of path and tree shaped facilities on trees
• The bi‐criteria doubly weighted center‐median path problem on a tree
• The generalized \(p\)-centdian on network

This page was built for publication: Range minimization problems in path-facility location on trees