Pages that link to "Item:Q2330101"

The following pages link to Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms (Q2330101):

Displaying 8 items.

• Solving the absolute 1-center problem in the quickest path case (Q2119314) (← links)
• Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm (Q2205945) (← links)
• Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks (Q5013391) (← links)
• Optimal algorithms for some inverse uncapacitated facility location problems on networks (Q5043849) (← links)
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)
• Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks (Q6080433) (← links)
• The max-sum inverse median location problem on trees with budget constraint (Q6095060) (← links)
• Minimizing the expense transmission time from the source node to demand nodes (Q6497033) (← links)