The following pages link to The inverse Fermat-Weber problem (Q976390):
Displayed 33 items.
- 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)
- 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)
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams (Q512990) (← 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)
- 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)
- 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)
- Inverse anti-\(k\)-centrum problem on networks with variable edge lengths (Q1988619) (← links)
- Inverse group 1-median problem on trees (Q2031325) (← links)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← 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)
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm (Q2687446) (← links)
- (Q2861544) (← links)
- (Q2861561) (← 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)
- 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)
- Mathematical models for the variable weights version of the inverse minimax circle location problem (Q5855728) (← links)
- Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)