Relevant Network Distances for Approximate Approach to Large p-Median Problems

DOI10.1007/978-3-319-00795-3_18MaRDI QIDQ5171787zbMATH OpenOpenAlexFDO

Authors Jaroslav Janáček, Marek Kvet

Publication date 12 February 2015

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-00795-3_18

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Network distance characteristics that affect computational effort in \(p\)-median location problems
• Solving the \(p\)-median problem on regular and lattice networks
• \(p\)-hub median problem for non-complete networks
• An approximation algorithm for the \(p\)-hub median problem
• The traveling \(k\)-median problem: approximating optimal network coverage
• The \(p\)-facility ordered median problem on networks
• Median problems in networks
• Complexity of the network median problem on planar grids
• scientific article; zbMATH DE number 1253050

Cited in

(1)

• Sequential zone adjustment for approximate solving of large p-median problems

This page was built for publication: Relevant Network Distances for Approximate Approach to Large p-Median Problems

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