Extensive facility location problems on networks with equity measures

DOI10.1016/j.dam.2008.03.035zbMath1163.90039OpenAlexW2067928043WikidataQ58217233 ScholiaQ58217233MaRDI QIDQ1028434

Justo Puerto, Andrea Scozzari, Federica Ricca

Publication date: 30 June 2009

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

Full work available at URL: https://idus.us.es/xmlui/handle/11441/26027

zbMATH Keywords

Hurwicz criterionrange criterionPareto-optimal pathspath location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Discrete location and assignment (90B80)

Related Items (12)

An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width ⋮ Equality measures properties for location problems ⋮ Unreliable point facility location problems on networks ⋮ Extensive facility location problems on networks: an updated review ⋮ Two Paths Location of a Tree with Positive or Negative Weights ⋮ Two paths location of a tree with positive or negative weights ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ Range minimization problems in path-facility location on trees ⋮ The continuous and discrete path‐variance problems on trees ⋮ Effectiveness-equity models for facility location problems on tree networks ⋮ Optimal shrinking of the distribution chain: the facilities delocation decision ⋮ Reliability problems in multiple path-shaped facility location on networks

Cites Work

• The path-variance problem on tree networks
• Algorithms for central-median paths with bounded length on trees
• 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.
• The centdian subtree on tree networks
• Locating tree-shaped facilities using the ordered median objective
• Algorithms for path medi-centers of a tree
• On locating path- or tree-shaped facilities on networks
• Dynamic Maintenance of Maxima of 2-d Point Sets
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extensive facility location problems on networks with equity measures