On locating path- or tree-shaped facilities on networks
From MaRDI portal
Publication:3141111
DOI10.1002/NET.3230230605zbMATH Open0806.90074OpenAlexW2060635739MaRDI QIDQ3141111FDOQ3141111
Authors: S. Louis Hakimi, E. Schmeichel, Martine Labbé 
Publication date: 12 December 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230230605
Recommendations
Cited In (52)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
- A branch-and-cut algorithm for the median-path problem
- The centdian subtree on tree networks
- On the minmax regret path median problem on trees
- Locating tree-shaped facilities using the ordered median objective
- The continuous and discrete path‐variance problems on trees
- Finding cores of limited length
- The path-variance problem on tree networks
- The tree of hubs location problem
- Facility location and the geometric minimum-diameter spanning tree.
- Extensive facility location problems on networks: an updated review
- Approximate maxima finding of continuous functions under restricted budget
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
- Locations on time-varying networks
- Algorithms for central-median paths with bounded length on trees
- The least element property of center location on tree networks with applications to distance and precedence constrained problems
- Extensive facility location problems on networks with equity measures
- Location of paths on trees with minimal eccentricity and superior section
- Minimax regret path location on trees
- Exploiting Structure: Location Problems on Trees and Treelike Graphs
- Finding the \(\ell\)-core of a tree
- General network design: a unified view of combined location and network design problems
- Tight bounds from a path based formulation for the tree of hub location problem
- Title not available (Why is that?)
- Approximating the tree and tour covers of a graph
- Optimal location of a path or tree on a network with cycles
- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
- Ant colony optimization for finding medians of weighted graphs
- A review of extensive facility location in networks
- Range minimization problems in path-facility location on trees
- On fixed-parameter solvability of the minimax path location problem
- Locating a Mobile Server Queueing Facility on a Tree Network
- The optimal location of a path or tree in a tree network
- Comparing different metaheuristic approaches for the median path problem with bounded length
- Optimal algorithms for the path/tree-shaped facility location problems in trees
- Location of speed-up subnetworks
- On a tree-shaped facility location problem of Minieka
- Accumulation Point Location on Tree Networks for Guaranteed Time Distribution
- Locating median paths on connected outerplanar graphs
- Title not available (Why is that?)
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
- Finding the conditional location of a median path on a tree
- Revisiting \(k\)-sum optimization
- Reliability problems in multiple path-shaped facility location on networks
- The nestedness property of location problems on the line
- Title not available (Why is that?)
- The location of median paths on grid graphs
- An improved algorithm for the minmax regret path centdian problem on trees
- Core and Conditional Core Path of Specified Length in Special Classes of Graphs
- Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
- Approximate maxima finding of continuous functions under restricted budget (extended abstract)
This page was built for publication: On locating path- or tree-shaped facilities on networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141111)
