Inverse median location problems with variable coordinates
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- An Algorithm for Large Zero-One Knapsack Problems
- Approximation schemes for a class of subset selection problems
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Inverse 1-center location problems with edge length augmentation on trees
- Inverse p-median problems with variable edge lengths
- Inverse center location problem on a tree
- Inverse median problems
- The complexity analysis of the inverse center location problem
- The inverse 1-maxian problem with edge length modification
- The inverse 1-median problem on a cycle
- The inverse Fermat-Weber problem
Cited in
(27)- The 1-median problem in \(\mathbb{R}^d\) with the Chebyshev-norm and its inverse problem
- Inverse anti-k-centrum problem on networks with variable edge lengths
- Reverse 1-center problem on weighted trees
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
- Mathematical models for the variable weights version of the inverse minimax circle location problem
- A linear time algorithm for inverse obnoxious center location problems on networks
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- Inverse p-median problems with variable edge lengths
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- 2-balanced flows and the inverse 1-median problem in the Chebyshev space
- Inverse min-max spanning \(r\)-arborescence problem under the weighted sum-type Hamming distance
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- A combinatorial algorithm for the 1-median problem in R^d with the Chebyshev norm
- 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
- The reverse selective balance center location problem on trees
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- Inverse median problems
- Some reverse location problems
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
- Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
This page was built for publication: Inverse median location problems with variable coordinates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623783)
