Pages that link to "Item:Q494693"

The following pages link to Inverse \(k\)-centrum problem on trees with variable vertex weights (Q494693):

Displaying 8 items.

• Inverse 1-median problem on block graphs with variable vertex weights (Q283940) (← links)
• 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)
• The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks (Q1616830) (← links)
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs (Q1697898) (← links)
• The inverse 1-center problem on cycles with variable edge lengths (Q1725838) (← links)
• Minimizing the expense transmission time from the source node to demand nodes (Q6497033) (← links)