The path-variance problem on tree networks

DOI10.1016/j.dam.2003.09.008zbMath1058.90032OpenAlexW2092221120MaRDI QIDQ705500

D. Kharzeev

Publication date: 31 January 2005

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

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

zbMATH Keywords

EqualityExtensive facilitesLocation on networks

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (6)

Extensive facility location problems on networks: an updated review ⋮ 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 ⋮ Extensive facility location problems on networks with equity measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The location of central structures in trees
• A review of extensive facility location in networks
• Equity measurement in facility location analysis: A review and framework
• On locating path- or tree-shaped facilities on networks
• Algorithms for a Core and k-Tree Core of a Tree
• The optimal location of a path or tree in a tree network
• A linear algorithm for a core of a tree
• An algorithm for the minimum variance point of a network
• The Variance Location Problem on a Network with Continuously distributed demand

This page was built for publication: The path-variance problem on tree networks