Pages that link to "Item:Q2337353"

The following pages link to Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees (Q2337353):

Displaying 19 items.

• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← links)
• The inverse \(p\)-maxian problem on trees with variable edge lengths (Q515099) (← links)
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees (Q534329) (← links)
• The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
• Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← links)
• Upgrading the 1-center problem with edge length variables on a tree (Q1662640) (← links)
• Inverse quickest center location problem on a tree (Q1741512) (← links)
• Center problems with pos/neg weights on trees (Q1869485) (← links)
• A note on the robust 1-center problem on trees (Q1872013) (← links)
• Inverse group 1-median problem on trees (Q2031325) (← links)
• Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
• Reverse 1-center problem on weighted trees (Q2790878) (← links)
• Inverse center location problems (Q2883558) (← links)
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees (Q3100698) (← links)
• (Q3572614) (← links)
• Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance (Q5085261) (← links)
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)
• Some robust inverse median problems on trees with interval costs (Q6612243) (← links)