An efficient algorithm for solving the median problem on real road networks

DOI10.1080/0305215X.2019.1631305WikidataQ127592404 ScholiaQ127592404MaRDI QIDQ5059369

J. David Porter, Saeed Ghanbartehrani

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

zbMATH Keywords

network locationmedian problemmulti-threaded Dijkstra's algorithmreal road networks

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Uses Software

• OR-Library
• SITATION
• MOD-DIST
• MENU-OKF
• OpenStreetMap

Cites Work

• A note on two problems in connexion with graphs
• Heuristics for the p-hub location problem
• A quadratic integer program for the location of interacting hub facilities
• Solution methods for thep-median problem: An annotated bibliography
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient algorithm for solving the median problem on real road networks