On the round-trip 1-center and 1-median problems

DOI10.1007/978-3-642-28076-4_12MaRDI QIDQ2889904zbMATH OpenOpenAlexFDO

Authors Biing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen

Publication date 8 June 2012

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28076-4_12

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80)

Recommendations

• Efficient algorithms for the round-trip 1-center and 1-median problems
• One-way and round-trip center location problems
• The Round-Trip p-Center and Covering Problem on a Tree
• Collection depots facility location problems in trees
• The \(k\)-centrum multi-facility location problem

Cited in

(8)

• Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
• Efficient algorithms for the round-trip 1-center and 1-median problems
• Collection depots facility location problems in trees
• Closed 3-stop center and periphery in graphs
• One-way and round-trip center location problems
• m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
• The 1-median and 1-highway problem
• The Round-Trip p-Center and Covering Problem on a Tree

This page was built for publication: On the round-trip 1-center and 1-median problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889904)