The extensive 1-median problem with radius on networks

DOI10.7494/opmath.2024.44.1.135zbMath1527.90128OpenAlexW4387859146MaRDI QIDQ6091088

Nguyen Thanh Hung, Tran Hoai Ngoc Nhan, Kien Trung Nguyen

Publication date: 23 November 2023

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/opmath.2024.44.1.135

zbMATH Keywords

treeconvexmedian problemextensive facility

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Foundations of location analysis
• Optimal algorithms for the path/tree-shaped facility location problems in trees
• The weighted Euclidean 1-center problem
• Locating lines and hyperplanes. Theory and algorithms
• The centdian subtree on tree networks
• Extensive facility location problems on networks: an updated review
• An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
• Finding a core of a tree with pos/neg weight
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• The Weighted Euclidean 1-Center Problem
• On finding the core of a tree with a specified length
• Locating A Median Subtree On A Network
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A linear algorithm for a core of a tree

This page was built for publication: The extensive 1-median problem with radius on networks