The continuous and discrete path‐variance problems on trees
From MaRDI portal
Publication:5191143
DOI10.1002/net.20284zbMath1178.90218WikidataQ58217245 ScholiaQ58217245MaRDI QIDQ5191143
Federica Ricca, Justo Puerto, Andrea Scozzari
Publication date: 28 July 2009
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20284
05C05: Trees
90B80: Discrete location and assignment
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Range minimization problems in path-facility location on trees, Two paths location of a tree with positive or negative weights, Comparing different metaheuristic approaches for the median path problem with bounded length, Extensive facility location problems on networks with equity measures, Reliability problems in multiple path-shaped facility location on networks, Unreliable point facility location problems on networks, Two Paths Location of a Tree with Positive or Negative Weights
Cites Work
- Unnamed Item
- 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.
- The centdian subtree on tree networks
- Locating tree-shaped facilities using the ordered median objective
- Algorithms for path medi-centers of a tree
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- On locating path- or tree-shaped facilities on networks
- Algorithms for a Core and k-Tree Core of a Tree
- A linear algorithm for a core of a tree
- 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