Pages that link to "Item:Q2632017"

The following pages link to Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (Q2632017):

Displaying 15 items.

• A linear time algorithm for inverse obnoxious center location problems on networks (Q301046) (← links)
• The inverse 1-median problem on tree networks with variable real edge lengths (Q460433) (← links)
• The inverse \(p\)-maxian problem on trees with variable edge lengths (Q515099) (← links)
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs (Q1685960) (← links)
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835) (← links)
• Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks (Q2033986) (← links)
• Expanding maximum capacity path under weighted sum-type distances (Q2144881) (← links)
• Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks (Q2158608) (← links)
• Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm (Q2205945) (← links)
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms (Q2330101) (← links)
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
• Optimal algorithms for some inverse uncapacitated facility location problems on networks (Q5043849) (← links)
• Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance (Q5085261) (← links)
• Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks (Q6080433) (← links)
• The max-sum inverse median location problem on trees with budget constraint (Q6095060) (← links)