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

DOI10.1016/j.jcss.2016.01.002zbMath1338.68120OpenAlexW2299543654MaRDI QIDQ269488

Jhih-Hong Ye, Biing-Feng Wang, 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

location theorycenterscollection depotslocation-routingmedians

Mathematics Subject Classification ID

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

Cites Work

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

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