Pages that link to "Item:Q421273"

The following pages link to An inverse approach to convex ordered median problems in trees (Q421273):

Displaying 29 items.

• Inverse 1-median problem on block graphs with variable vertex weights (Q283940) (← links)
• A linear time algorithm for inverse obnoxious center location problems on networks (Q301046) (← links)
• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance (Q320084) (← links)
• Inverse \(k\)-centrum problem on trees with variable vertex weights (Q494693) (← links)
• Inverse \(p\)-median problems with variable edge lengths (Q532535) (← 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)
• A polynomial method for the pos/neg weighted 3-median problem on a tree (Q1006548) (← links)
• Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← links)
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks (Q1616830) (← 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)
• Inverse quickest center location problem on a tree (Q1741512) (← links)
• The ordered anti-median problem with distances derived from a strictly convex norm (Q1941392) (← links)
• Inverse anti-\(k\)-centrum problem on networks with variable edge lengths (Q1988619) (← links)
• Inverse group 1-median problem on trees (Q2031325) (← links)
• Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm (Q2205945) (← links)
• Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
• The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms (Q2330101) (← links)
• Upgrading edges in the maximal covering location problem (Q2673553) (← links)
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees (Q3100698) (← links)
• Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems (Q4689388) (← links)
• Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance (Q5085261) (← links)
• Some polynomially solvable cases of the inverse ordered 1-median problem on trees (Q5162023) (← links)
• On some inverse 1-center location problems (Q5382943) (← links)
• The max-sum inverse median location problem on trees with budget constraint (Q6095060) (← links)
• Some robust inverse median problems on trees with interval costs (Q6612243) (← links)
• Robust reverse 1-center problems on trees with interval costs (Q6661114) (← links)