Pages that link to "Item:Q1819243"

The following pages link to Algorithms for path medi-centers of a tree (Q1819243):

Displaying 22 items.

• Range minimization problems in path-facility location on trees (Q713326) (← links)
• Algorithms for connected \(p\)-centdian problem on block graphs (Q724753) (← links)
• Evolutionary design of oriented-tree networks using Cayley-type encodings (Q730939) (← links)
• A polynomial algorithm for the multicriteria cent-dian location problem (Q864019) (← links)
• Algorithms for central-median paths with bounded length on trees (Q864041) (← 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)
• The location of central structures in trees (Q1097827) (← links)
• Location of paths on trees with minimal eccentricity and superior section (Q1284599) (← links)
• The centdian subtree on tree networks (Q1602695) (← links)
• Extensive facility location problems on networks: an updated review (Q1667394) (← links)
• An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
• Revisiting \(k\)-sum optimization (Q1675256) (← links)
• Finding an optimal core on a tree network with M/G/c/c state-dependent queues (Q1731597) (← links)
• Finding a core of a tree with pos/neg weight (Q1935945) (← links)
• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
• An algorithm for solving the bi-objective median path-shaped facility on a tree network (Q2305157) (← links)
• Minimax regret path location on trees (Q3100694) (← links)
• The Connected p-Centdian Problem on Block Graphs (Q3467867) (← links)
• Medi-Centers of a Tree (Q3755207) (← links)
• Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network (Q4943071) (← links)
• The continuous and discrete path‐variance problems on trees (Q5191143) (← links)