Pages that link to "Item:Q1031869"

The following pages link to Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869):

Displaying 9 items.

• 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)
• Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
• An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← 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)
• On fixed-parameter solvability of the minimax path location problem (Q6063573) (← links)
• The extensive 1-median problem with radius on networks (Q6091088) (← links)