Pages that link to "Item:Q5689811"

The following pages link to On the location of a tree-shaped facility (Q5689811):

Displaying 40 items.

• A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← links)
• Dynamic and static algorithms for optimal placement of resources in a tree (Q671529) (← links)
• Range minimization problems in path-facility location on trees (Q713326) (← links)
• Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
• The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation (Q864015) (← links)
• Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
• A minimum length covering subgraph of a network (Q920001) (← links)
• Finding the conditional location of a median path on a tree (Q937298) (← links)
• An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees (Q976129) (← links)
• Extensive facility location problems on networks with equity measures (Q1028434) (← links)
• \((r,p)\)-centroid problems on paths and trees (Q1034634) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• A unified limited column generation approach for facility location problems on trees (Q1290209) (← links)
• Solving the uncapacited plant location problem on trees (Q1327217) (← links)
• Finding the \(\ell\)-core of a tree (Q1348250) (← links)
• Bi-objective median subtree location problems (Q1413764) (← links)
• The centdian subtree on tree networks (Q1602695) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• Extensive facility location problems on networks: an updated review (Q1667394) (← links)
• Comments on: ``Extensive facility location problems on networks: an updated review'' (Q1667395) (← links)
• Rejoinder on: ``Extensive facility location problems on networks: an updated review'' (Q1667396) (← links)
• An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
• Revisiting \(k\)-sum optimization (Q1675256) (← links)
• Location routing problems on trees (Q1735670) (← links)
• Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
• The plant location problem with demand-dependent setup costs and centralized allocation (Q1806866) (← links)
• Algorithmic results for ordered median problems (Q1866979) (← links)
• Locating median cycles in networks (Q1887911) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← links)
• On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges (Q2294142) (← links)
• Reliability problems in multiple path-shaped facility location on networks (Q2339811) (← links)
• On the minmax regret path median problem on trees (Q2353396) (← links)
• Improved algorithms for some competitive location centroid problems on paths, trees and graphs (Q2375952) (← links)
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs (Q2564302) (← links)
• Unreliable point facility location problems on networks (Q2636810) (← links)
• A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract) (Q2958334) (← links)
• Minimax regret path location on trees (Q3100694) (← links)
• The generalized <i>P</i>‐forest problem on a tree network (Q3993630) (← links)
• On a tree-shaped facility location problem of Minieka (Q4021818) (← links)