Network distance characteristics that affect computational effort in \(p\)-median location problems

DOI10.1016/S0377-2217(99)00336-7zbMath0982.90031OpenAlexW1970442741MaRDI QIDQ1841151

David A. Schilling, Kenneth E. Rosing, Charles S. Re Velle

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00336-7

zbMATH Keywords

heuristicscombinatorial optimizationlocation\(p\)-medianEuclidean inter-point distancesrandomly generated distance matricesshortest paths developed from a predefined network

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (2)

The directional \(p\)-median problem: definition, complexity, and algorithms ⋮ Location analysis: a synthesis and survey

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Facility siting and integer-friendly programming
• An efficient tabu search procedure for the \(p\)-median problem
• Heuristic concentration: Two stage solution construction
• The Effect of Spatial Structure on p-Median Results
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Network distance characteristics that affect computational effort in \(p\)-median location problems