Efficient algorithms for the round-trip 1-center and 1-median problems

DOI10.1016/J.JCSS.2016.01.002MaRDI QIDQ269488zbMATH OpenOpenAlexFDO

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

Publication date 18 April 2016

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2016.01.002

zbMATH Keywords

centerscollection depotslocation theorylocation-routingmedians

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80)

Recommendations

• On the round-trip 1-center and 1-median problems
• Efficient Algorithms for the Capacitated 1-Median Problem
• Efficient algorithms for the one-dimensional \(k\)-center problem
• An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces
• Efficient algorithms for centers and medians in interval and circular-arc graphs
• scientific article; zbMATH DE number 1670650
• An approximation algorithm for the \(p\)-hub median problem
• Approximation algorithms for median hub location problems

Cites work

• scientific article; zbMATH DE number 9246 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A Shortest Path Algorithm for Real-Weighted Undirected Graphs
• A new approach to all-pairs shortest paths on real-weighted graphs
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Collection depots facility location problems in trees
• Introduction to algorithms
• Location-routing: issues, models and methods
• Minisum collection depots location problem with multiple facilities on a network
• Minmax \(p\)-traveling salesmen location problems on a tree
• More algorithms for all-pairs shortest paths in weighted graphs
• On the collection depots location problem
• One-facility location with rectilinear tour distances
• One-way and round-trip center location problems
• Probabilistic a priori routing-location problems
• Single facility collection depots location problem in the plane
• The Round-Trip p-Center and Covering Problem on a Tree
• The collection depots location problem on networks

Cited in

(9)

• Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
• Collection depots facility location problems in trees
• Closed 3-stop center and periphery in graphs
• On the round-trip 1-center and 1-median problems
• One-way and round-trip center location problems
• Minimizing the expense transmission time from the source node to demand nodes
• Note on a Rectilinear Distance Round-Trip Location Problem
• The Round-Trip p-Center and Covering Problem on a Tree
• Efficient Algorithms for the Capacitated 1-Median Problem

This page was built for publication: Efficient algorithms for 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 Q269488)