Inverse 1-median problem on block graphs with variable vertex weights
type: Item
instance of: scholarly article
title: Inverse 1-median problem on block graphs with variable vertex weights
zbMATH Open document ID: 1338.90085
author: Kien Trung Nguyen
published in: Journal of Optimization Theory and Applications
publication date: 2016-05-17T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6581067
zbMATH Keywords: location problem
zbMATH Keywords: inverse optimization
zbMATH Keywords: continuous knapsack problem
zbMATH Keywords: block graph
zbMATH Keywords: convex
MaRDI profile type: Publication
full work available at URL: s10957-015-0829-2
OpenAlex ID: W2214775348
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Inverse median problems
cites work: The inverse 1-median problem on a tree and on a path
cites work: The inverse 1-median problem on a cycle
cites work: Inverse \(p\)-median problems with variable edge lengths
cites work: An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
cites work: Inverse 1-median problem on trees under weighted Hamming distance
cites work: The complexity analysis of the inverse center location problem
cites work: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
cites work: Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
cites work: Inverse 1-center location problems with edge length augmentation on trees
cites work: Inverse eccentric vertex problem on networks
cites work: Inverse \(k\)-centrum problem on trees with variable vertex weights
cites work: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
cites work: Location Theory
cites work: An inverse approach to convex ordered median problems in trees
cites work: The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
cites work: A linear time algorithm for inverse obnoxious center location problems on networks
cites work: Q3097395
cites work: An Algorithm for Large Zero-One Knapsack Problems
DOI: 10.1007/S10957-015-0829-2
description: scientific article; zbMATH DE number 6581067