Extensive facility location problems on networks: an updated review
From MaRDI portal
Publication:1667394
DOI10.1007/s11750-018-0476-5zbMath1397.90081OpenAlexW2796738676WikidataQ58217108 ScholiaQ58217108MaRDI QIDQ1667394
Justo Puerto, Federica Ricca, Andrea Scozzari
Publication date: 28 August 2018
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-018-0476-5
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)
Related Items (13)
Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint ⋮ Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ A linear time algorithm for connected \(p\)-centdian problem on block graphs ⋮ A linear time algorithm for balance vertices on trees ⋮ A directional approach to gradual cover ⋮ The extensive 1-median problem with radius on networks ⋮ Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm ⋮ Mathematical optimization models for reallocating and sharing health equipment in pandemic situations ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ Inverse group 1-median problem on trees ⋮ On location-allocation problems for dimensional facilities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The path-variance problem on tree networks
- Range minimization problems in path-facility location on trees
- Algorithms for central-median paths with bounded length on trees
- Comparing different metaheuristic approaches for the median path problem with bounded length
- Finding the conditional location of a median path on a tree
- Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees
- Extensive facility location problems on networks with equity measures
- Optimal algorithms for the path/tree-shaped facility location problems in trees
- Finding the two-core of a tree
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
- A review of extensive facility location in networks
- Efficient solution methods for covering tree problems
- Finding the \(\ell\)-core of a tree
- Improved algorithms for several network location problems with equality measures.
- Continuous location of dimensional structures.
- Bi-objective median subtree location problems
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- The centdian subtree on tree networks
- The nestedness property of location problems on the line
- Revisiting \(k\)-sum optimization
- Locating tree-shaped facilities using the ordered median objective
- Algorithms for path medi-centers of a tree
- Locating median cycles in networks
- Reliability problems in multiple path-shaped facility location on networks
- On the minmax regret path median problem on trees
- A note on the subtree ordered median problem in networks based on nestedness property
- The location of median paths on grid graphs
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Finding a 2-Core of a Tree in Linear Time
- Maintaining information in fully dynamic trees with top trees
- Locating median paths on connected outerplanar graphs
- Minimax regret path location on trees
- Location Theory
- On locating path- or tree-shaped facilities on networks
- Algorithms for a Core and k-Tree Core of a Tree
- Optimal location of a path or tree on a network with cycles
- Locating a cycle in a transportation or a telecommunications network
- Core and Conditional Core Path of Specified Length in Special Classes of Graphs
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- The optimal location of a path or tree in a tree network
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- A linear algorithm for a core of a tree
- Linear-time computability of combinatorial problems on series-parallel graphs
- The generalized P‐forest problem on a tree network
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- A Linear Time Algorithm for Finding ak-Tree Core
- Hamilton Paths in Grid Graphs
- Finding kth paths and p-centers by generating and searching good data structures
- Multifacility ordered median problems on networks: A further analysis
- Efficient algorithms for finding the (k,l)-core of tree networks
- Efficient Algorithms for Finding a Core of a Tree with a Specified Length
- Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
- Collection depots facility location problems in trees
- The continuous and discrete path‐variance problems on trees
- Location Science
- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
- Conditional location of path and tree shaped facilities on trees
- Efficient algorithms for a constrained k-tree core problem in a tree network
- The bi‐criteria doubly weighted center‐median path problem on a tree
This page was built for publication: Extensive facility location problems on networks: an updated review
