Pages that link to "Item:Q3141111"

The following pages link to On locating path- or tree-shaped facilities on networks (Q3141111):

Displaying 48 items.

• Approximating the tree and tour covers of a graph (Q688437) (← links)
• The path-variance problem on tree networks (Q705500) (← 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)
• Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
• Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
• Finding the conditional location of a median path on a tree (Q937298) (← links)
• Extensive facility location problems on networks with equity measures (Q1028434) (← links)
• Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784) (← links)
• Approximate maxima finding of continuous functions under restricted budget (Q1274326) (← links)
• A review of extensive facility location in networks (Q1278421) (← links)
• Location of paths on trees with minimal eccentricity and superior section (Q1284599) (← links)
• The least element property of center location on tree networks with applications to distance and precedence constrained problems (Q1319019) (← links)
• Finding the \(\ell\)-core of a tree (Q1348250) (← links)
• Facility location and the geometric minimum-diameter spanning tree. (Q1421033) (← 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)
• The nestedness property of location problems on the line (Q1667399) (← links)
• An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
• Revisiting \(k\)-sum optimization (Q1675256) (← links)
• Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees (Q1942273) (← links)
• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
• Location of speed-up subnetworks (Q2259045) (← links)
• Reliability problems in multiple path-shaped facility location on networks (Q2339811) (← links)
• On the minmax regret path median problem on trees (Q2353396) (← links)
• The location of median paths on grid graphs (Q2480201) (← links)
• A branch-and-cut algorithm for the median-path problem (Q2490367) (← links)
• Locating median paths on connected outerplanar graphs (Q3008924) (← links)
• Minimax regret path location on trees (Q3100694) (← links)
• Optimal location of a path or tree on a network with cycles (Q3202133) (← links)
• Accumulation Point Location on Tree Networks for Guaranteed Time Distribution (Q3204319) (← links)
• Core and Conditional Core Path of Specified Length in Special Classes of Graphs (Q3605503) (← links)
• The optimal location of a path or tree in a tree network (Q3703613) (← links)
• On a tree-shaped facility location problem of Minieka (Q4021818) (← links)
• Ant colony optimization for finding medians of weighted graphs (Q4908024) (← links)
• Locations on time-varying networks (Q4934867) (← links)
• (Q5009599) (← links)
• Finding cores of limited length (Q5096925) (← links)
• The continuous and discrete path‐variance problems on trees (Q5191143) (← links)
• Exploiting Structure: Location Problems on Trees and Treelike Graphs (Q5506729) (← links)
• On fixed-parameter solvability of the minimax path location problem (Q6063573) (← links)
• Finding the most degree-central walks and paths in a graph: exact and heuristic approaches (Q6167664) (← links)
• Approximate maxima finding of continuous functions under restricted budget (extended abstract) (Q6550550) (← links)