The inverse connected \(p\)-median problem on block graphs under various cost functions

DOI10.1007/s10479-020-03651-3zbMath1451.90031OpenAlexW3033461884MaRDI QIDQ827099

Kien Trung Nguyen, Nguyen Thanh Hung

Publication date: 6 January 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-020-03651-3

zbMATH Keywords

location theorycombinatorial optimizationblock graphsinverse optimizationconnected \(p\)-median

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (4)

On the \(A_\sigma\)-spectral radii of graphs with some given parameters ⋮ A linear time algorithm for connected \(p\)-centdian problem on block graphs ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ The connected p-median problem on complete multi-layered graphs

Cites Work

• Inverse 1-median problem on block graphs with variable vertex weights
• The connected \(p\)-median problem on block graphs
• 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
• The connected \(p\)-center problem on block graphs with forbidden vertices
• An inverse approach to convex ordered median problems in trees
• Inverse 1-median problem on trees under weighted Hamming distance
• Inverse \(k\)-centrum problem on trees with variable vertex weights
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• Algorithms for connected \(p\)-centdian problem on block graphs
• Inverse minimum flow problem
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• On an instance of the inverse shortest paths problem
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
• The connected \(p\)-center problem on cactus graphs
• On inverse linear programming problems under the bottleneck-type weighted Hamming distance
• The inverse 1-center problem on cycles with variable edge lengths
• Inverse quickest center location problem on a tree
• The complexity analysis of the inverse center location problem
• Inverse combinatorial optimization: a survey on problems, methods, and results
• On inverse traveling salesman problems
• Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
• Inverse median problems
• The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
• The partial inverse minimum spanning tree problem when weight increase is forbidden
• The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
• A model for the inverse 1-median problem on trees under uncertain costs
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Location Theory
• Inverse Optimization
• Efficient Algorithms for the Inverse Spanning-Tree Problem
• A Characterization of Block-Graphs
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An Algorithm for Large Zero-One Knapsack Problems
• Combinatorial algorithms for inverse network flow problems
• On some inverse 1-center location problems

This page was built for publication: The inverse connected \(p\)-median problem on block graphs under various cost functions