Pages that link to "Item:Q445338"

The following pages link to Inverse 1-median problem on trees under weighted Hamming distance (Q445338):

Displaying 10 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)
• Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← links)
• The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
• An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106) (← links)
• Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
• The inverse 1-center problem on cycles with variable edge lengths (Q1725838) (← links)
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835) (← links)
• A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment (Q6495790) (← links)