On locating path- or tree-shaped facilities on networks
From MaRDI portal
Publication:3141111
DOI10.1002/net.3230230605zbMath0806.90074OpenAlexW2060635739MaRDI QIDQ3141111
Martine Labbé, S. Louis Hakimi, Edward F. Schmeichel
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
Related Items
Tight bounds from a path based formulation for the tree of hub location problem, A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, Finding the \(\ell\)-core of a tree, Algorithms for central-median paths with bounded length on trees, Locations on time-varying networks, Extensive facility location problems on networks: an updated review, The nestedness property of location problems on the line, An improved algorithm for the minmax regret path centdian problem on trees, Revisiting \(k\)-sum optimization, On a tree-shaped facility location problem of Minieka, General network design: a unified view of combined location and network design problems, Finding cores of limited length, On fixed-parameter solvability of the minimax path location problem, Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees, Finding the most degree-central walks and paths in a graph: exact and heuristic approaches, Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem, Comparing different metaheuristic approaches for the median path problem with bounded length, Finding the conditional location of a median path on a tree, Locating median paths on connected outerplanar graphs, Ant colony optimization for finding medians of weighted graphs, Approximating the tree and tour covers of a graph, The location of median paths on grid graphs, Location of speed-up subnetworks, A branch-and-cut algorithm for the median-path problem, The path-variance problem on tree networks, Locating tree-shaped facilities using the ordered median objective, Range minimization problems in path-facility location on trees, The continuous and discrete path‐variance problems on trees, Core and Conditional Core Path of Specified Length in Special Classes of Graphs, Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem, Approximate maxima finding of continuous functions under restricted budget, Extensive facility location problems on networks with equity measures, A review of extensive facility location in networks, Minimax regret path location on trees, Optimal algorithms for the path/tree-shaped facility location problems in trees, Location of paths on trees with minimal eccentricity and superior section, The tree of hubs location problem, Reliability problems in multiple path-shaped facility location on networks, The centdian subtree on tree networks, On the minmax regret path median problem on trees
