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 14 items.

• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance (Q320084) (← links)
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← links)
• An inverse approach to convex ordered median problems in trees (Q421273) (← links)
• Inverse group 1-median problem on trees (Q2031325) (← links)
• 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)
• Some polynomially solvable cases of the inverse ordered 1-median problem on trees (Q5162023) (← 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)
• Robust reverse 1-center problems on trees with interval costs (Q6661114) (← links)