Pages that link to "Item:Q732826"

The following pages link to Inverse center location problem on a tree (Q732826):

Displaying 30 items.

• A linear time algorithm for inverse obnoxious center location problems on networks (Q301046) (← links)
• Inverse 1-median problem on trees under weighted Hamming distance (Q445338) (← 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)
• Inverse median location problems with variable coordinates (Q623783) (← links)
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
• Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← links)
• Reverse selective obnoxious center location problems on tree graphs (Q1650850) (← links)
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs (Q1685960) (← links)
• Inverse quickest center location problem on a tree (Q1741512) (← links)
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms (Q1788861) (← links)
• The complexity analysis of the inverse center location problem (Q1819202) (← 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)
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (Q2632017) (← links)
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
• Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm (Q2687446) (← links)
• Reverse 1-center problem on weighted trees (Q2790878) (← links)
• Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
• Inverse center location problems (Q2883558) (← 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)
• Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms (Q4987701) (← 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 selective variants of the classical and inverse median location problems on trees (Q5238068) (← links)
• On some inverse 1-center location problems (Q5382943) (← links)
• Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
• Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm (Q6191111) (← links)