Pages that link to "Item:Q1616830"

The following pages link to On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks (Q1616830):

Displaying 10 items.

• The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
• Inverse quickest center location problem on a tree (Q1741512) (← 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)
• The minmax regret inverse maximum weight problem (Q2243298) (← links)
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms (Q2330101) (← links)
• Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance (Q5085261) (← links)
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)
• Minimizing the expense transmission time from the source node to demand nodes (Q6497033) (← links)