Inverse 1-median problem on trees under weighted Hamming distance
From MaRDI portal
Publication:445338
DOI10.1007/S10898-011-9742-XzbMATH Open1273.90237OpenAlexW2082122685MaRDI QIDQ445338FDOQ445338
Publication date: 24 August 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9742-x
Recommendations
- Inverse 1-median problem on trees under weighted \(l _{ \infty }\) norm
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- The inverse 1-median problem on a tree and on a path
- Inverse median problems
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
Programming involving graphs or networks (90C35) Programming in abstract spaces (90C48) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Inverse 1-center location problems with edge length augmentation on trees
- The complexity analysis of the inverse center location problem
- Inverse median problems
- The inverse 1-median problem on a tree and on a path
- An Algorithm for Large Zero-One Knapsack Problems
- The inverse 1-median problem on a cycle
- Inverse median location problems with variable coordinates
- Inverse center location problem on a tree
- The inverse 1-maxian problem with edge length modification
- The inverse Fermat-Weber problem
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Some inverse optimization problems under the Hamming distance
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- Approximation schemes for a class of subset selection problems
- Inverse 1-median Problem on Trees under Weighted l ∞ Norm
- Inverse Bottleneck Optimization Problems on Networks
- Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
Cited In (42)
- The inverse connected \(p\)-median problem on block graphs under various cost functions
- Classical and inverse median location problems under uncertain environment
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- Inverse group 1-median problem on trees
- The inverse 1-median problem on tree networks with variable real edge lengths
- Inverse quickest center location problem on a tree
- Inverse 1-median problem on block graphs with variable vertex weights
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- Inverse minimum flow problem under the weighted sum-type Hamming distance
- Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
- Some robust inverse median problems on trees with interval costs
- The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
- Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance
- 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
- Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
- Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
- Constrained inverse minimum flow problems under the weighted Hamming distance
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
- Inverse median problems
- Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems
- The inverse 1-center problem on cycles with variable edge lengths
- A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Inverse single facility location problem on a tree with balancing on the distance of server to clients
- Title not available (Why is that?)
- Robust reverse 1-center problems on trees with interval costs
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
- Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
- Inverse and reverse balanced facility location problems with variable edge lengths on trees
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
This page was built for publication: Inverse 1-median problem on trees under weighted Hamming distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q445338)
