The inverse connected \(p\)-median problem on block graphs under various cost functions
type: Item
instance of: scholarly article
title: The inverse connected \(p\)-median problem on block graphs under various cost functions
zbMATH Open document ID: 1451.90031
author: Kien Trung Nguyen
author: Nguyen Thanh Hung
published in: Annals of Operations Research
publication date: 2021-01-06T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7290732
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: location theory
zbMATH Keywords: connected \(p\)-median
zbMATH Keywords: inverse optimization
zbMATH Keywords: block graphs
MaRDI profile type: Publication
full work available at URL: s10479-020-03651-3
OpenAlex ID: W3033461884
cites work: Combinatorial algorithms for inverse network flow problems
cites work: Inverse Optimization
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: The connected \(p\)-center problem on cactus graphs
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: The inverse Fermat-Weber problem
cites work: Inverse median problems
cites work: The inverse 1-median problem on a cycle
cites work: On an instance of the inverse shortest paths problem
cites work: The partial inverse minimum spanning tree problem when weight increase is forbidden
cites work: The complexity analysis of the inverse center location problem
cites work: The connected \(p\)-median problem on block graphs
cites work: On inverse traveling salesman problems
cites work: Inverse minimum flow problem
cites work: A Characterization of Block-Graphs
cites work: An inverse approach to convex ordered median problems in trees
cites work: Inverse 1-median problem on trees under weighted Hamming distance
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Efficient Algorithms for the Inverse Spanning-Tree Problem
cites work: Algorithms for connected \(p\)-centdian problem on block graphs
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Inverse quickest center location problem on a tree
cites work: Inverse 1-median problem on block graphs with variable vertex weights
cites work: The inverse 1-center problem on cycles with variable edge lengths
cites work: Inverse \(k\)-centrum problem on trees with variable vertex weights
cites work: The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
cites work: A model for the inverse 1-Median problem on trees under uncertain costs
cites work: On some inverse 1-center location problems
cites work: Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
cites work: On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
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: The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
cites work: Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
cites work: The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
cites work: On inverse linear programming problems under the bottleneck-type weighted Hamming distance
cites work: The connected \(p\)-center problem on block graphs with forbidden vertices
DOI: 10.1007/S10479-020-03651-3
description: scientific article; zbMATH DE number 7290732