Pages that link to "Item:Q951097"

The following pages link to The inverse 1-median problem on a cycle (Q951097):

Displaying 48 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)
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← links)
• An inverse approach to convex ordered median problems in trees (Q421273) (← links)
• Inverse 1-median problem on trees under weighted Hamming distance (Q445338) (← links)
• The inverse 1-median problem on tree networks with variable real edge lengths (Q460433) (← 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)
• The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
• Upgrading \(p\)-median problem on a path (Q894530) (← links)
• The inverse Fermat-Weber problem (Q976390) (← 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)
• Reverse 1-maxian problem with keeping existing 1-median (Q1735954) (← 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)
• 2-balanced flows and the inverse 1-median problem in the Chebyshev space (Q1926492) (← links)
• Classical and inverse median location problems under uncertain environment (Q1987593) (← links)
• Inverse anti-\(k\)-centrum problem on networks with variable edge lengths (Q1988619) (← links)
• Inverse single facility location problem on a tree with balancing on the distance of server to clients (Q2076390) (← 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)
• Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective (Q2318607) (← links)
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees (Q2337353) (← links)
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (Q2632017) (← links)
• Inverse and reverse balanced facility location problems with variable edge lengths on trees (Q2656494) (← links)
• The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion (Q2656787) (← links)
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
• A generalized interval type-2 fuzzy random variable based algorithm under mean chance value at risk criterion for inverse 1-median location problems on tree networks with uncertain costs (Q2668035) (← links)
• A model for the inverse 1-median problem on trees under uncertain costs (Q2809658) (← links)
• Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
• (Q2861544) (← 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)
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions (Q4981873) (← links)
• (Q4987513) (← 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)
• 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)
• 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)
• A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment (Q6495790) (← links)