A model for the inverse 1-Median problem on trees under uncertain costs
From MaRDI portal
Publication:2809658
Recommendations
- The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
- Classical and inverse median location problems under uncertain environment
- Inverse 1-median problem on trees under weighted \(l _{ \infty }\) norm
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- The inverse 1-median problem on a tree and on a path
Cites work
- An Algorithm for Large Zero-One Knapsack 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 \(k\)-centrum problem on trees with variable vertex weights
- Inverse eccentric vertex problem on networks
- Reverse 1-center problem on weighted trees
- Shortest path problem with uncertain arc lengths
- The complexity analysis of the inverse center location problem
- The inverse 1-median problem on a cycle
- The inverse 1-median problem on a tree and on a path
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
Cited in
(19)- The continuous knapsack problem with capacities
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- Some robust inverse median problems on trees with interval costs
- An inverse approach to convex ordered median problems in trees
- The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
- The inverse connected \(p\)-median problem on block graphs under various cost functions
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm
- Classical and inverse median location problems under uncertain environment
- The inverse 1-center problem on cycles with variable edge lengths
- 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 minmax regret inverse maximum weight problem
- scientific article; zbMATH DE number 6311584 (Why is no real title available?)
- Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
- Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees
- Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
- Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
This page was built for publication: A model for the inverse 1-Median problem on trees under uncertain costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809658)
