Inverse 1-median problem on trees under weighted Hamming distance

DOI10.1007/s10898-011-9742-xzbMath1273.90237OpenAlexW2082122685MaRDI QIDQ445338

Xiucui Guan, Binwu Zhang

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

zbMATH Keywords

treebinary search0-1 knapsack probleminverse 1-median problemweighted Hamming distance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Programming in abstract spaces (90C48) Discrete location and assignment (90B80)

Related Items (38)

The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ Inverse 1-median problem on block graphs with variable vertex weights ⋮ Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms ⋮ 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 and reverse balanced facility location problems with variable edge lengths on trees ⋮ The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion ⋮ An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ 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 max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm ⋮ 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 ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ Unnamed Item ⋮ The inverse 1-median problem on tree networks with variable real edge lengths ⋮ The inverse 1-center problem on cycles with variable edge lengths ⋮ Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks ⋮ Inverse quickest center location problem on a tree ⋮ Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance ⋮ Classical and inverse median location problems under uncertain environment ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ Inverse minimum flow problem under the weighted sum-type Hamming distance ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector ⋮ Inverse group 1-median problem on trees ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ Constrained inverse minimum flow problems under the weighted Hamming distance ⋮ Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees ⋮ Inverse single facility location problem on a tree with balancing on the distance of server to clients ⋮ Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms ⋮ Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse median location problems with variable coordinates
• Inverse center location problem on a tree
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
• The inverse 1-maxian problem with edge length modification
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• Inverse 1-center location problems with edge length augmentation on trees
• The complexity analysis of the inverse center location problem
• Approximation schemes for a class of subset selection problems
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• Inverse median problems
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Some inverse optimization problems under the Hamming distance
• Inverse 1-median Problem on Trees under Weighted l  ∞  Norm
• An Algorithm for Large Zero-One Knapsack Problems
• Inverse Bottleneck Optimization Problems on Networks

This page was built for publication: Inverse 1-median problem on trees under weighted Hamming distance