Extensive facility location problems on networks: an updated review
type: Item
instance of: scholarly article
title: Extensive facility location problems on networks: an updated review
zbMATH Open document ID: 1397.90081
author: Justo Puerto
author: Federica Ricca
author: Andrea Scozzari
published in: Top
publication date: 2018-08-28T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6928189
zbMATH Keywords: path location problems
zbMATH Keywords: tree location problems
zbMATH Keywords: ordered median
zbMATH Keywords: equity measures
zbMATH Keywords: minimum loss criteria
MaRDI profile type: Publication
full work available at URL: s11750-018-0476-5
OpenAlex ID: W2796738676
Wikidata QID: Q58217108
cites work: Maintaining information in fully dynamic trees with top trees
cites work: On the minmax regret path median problem on trees
cites work: Algorithms for path medi-centers of a tree
cites work: Core and Conditional Core Path of Specified Length in Special Classes of Graphs
cites work: Finding the two-core of a tree
cites work: Efficient algorithms for finding the (k,l)-core of tree networks
cites work: Finding the \(\ell\)-core of a tree
cites work: Algorithms for central-median paths with bounded length on trees
cites work: The location of median paths on grid graphs
cites work: Collection depots facility location problems in trees
cites work: Optimal algorithms for the path/tree-shaped facility location problems in trees
cites work: Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
cites work: Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees
cites work: Efficient solution methods for covering tree problems
cites work: The path-variance problem on tree networks
cites work: Continuous location of dimensional structures.
cites work: Linear-time computability of combinatorial problems on series-parallel graphs
cites work: Finding kth paths and p-centers by generating and searching good data structures
cites work: Bi-objective median subtree location problems
cites work: On locating path- or tree-shaped facilities on networks
cites work: Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
cites work: Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
cites work: Hamilton Paths in Grid Graphs
cites work: Multifacility ordered median problems on networks: A further analysis
cites work: Q5689811
cites work: Locating median cycles in networks
cites work: Locating a cycle in a transportation or a telecommunications network
cites work: Location Science
cites work: Comparing different metaheuristic approaches for the median path problem with bounded length
cites work: Locating median paths on connected outerplanar graphs
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: A review of extensive facility location in networks
cites work: Improved algorithms for several network location problems with equality measures.
cites work: The optimal location of a path or tree in a tree network
cites work: A linear algorithm for a core of a tree
cites work: Q4934873
cites work: Location Theory
cites work: Efficient Algorithms for Finding a Core of a Tree with a Specified Length
cites work: Algorithms for a Core and k-Tree Core of a Tree
cites work: Locating tree-shaped facilities using the ordered median objective
cites work: The bi‐criteria doubly weighted center‐median path problem on a tree
cites work: Extensive facility location problems on networks with equity measures
cites work: The continuous and discrete path‐variance problems on trees
cites work: Minimax regret path location on trees
cites work: Range minimization problems in path-facility location on trees
cites work: Reliability problems in multiple path-shaped facility location on networks
cites work: Revisiting \(k\)-sum optimization
cites work: Optimal location of a path or tree on a network with cycles
cites work: The nestedness property of location problems on the line
cites work: Q4367277
cites work: A Linear Time Algorithm for Finding ak-Tree Core
cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
cites work: Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
cites work: Sorting weighted distances with applications to objective function evaluations in single facility location problems.
cites work: The generalized P‐forest problem on a tree network
cites work: The centdian subtree on tree networks
cites work: Conditional location of path and tree shaped facilities on trees
cites work: A note on the subtree ordered median problem in networks based on nestedness property

Extensive facility location problems on networks: an updated review (cites work)
cites work: Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

Extensive facility location problems on networks: an updated review (cites work)
cites work: Finding a 2-core of a tree in linear time

Extensive facility location problems on networks: an updated review (cites work)
cites work: Efficient algorithms for a constrained k-tree core problem in a tree network

Extensive facility location problems on networks: an updated review (cites work)
cites work: Finding the conditional location of a median path on a tree

Extensive facility location problems on networks: an updated review (DOI)
DOI: 10.1007/S11750-018-0476-5