On the conditional \(p\)-median problem

DOI10.1016/0305-0548(94)00033-5zbMath0830.90070OpenAlexW2091987642MaRDI QIDQ1894727

Zvi Drezner

Publication date: 24 July 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)00033-5

zbMATH Keywords

heuristic algorithmconditional \(p\)-median

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

The Weber obnoxious facility location model: a big arc small arc approach ⋮ The multi-facility median problem with Pos/Neg weights on general graphs ⋮ A directional approach to gradual cover ⋮ A decomposition approach for facility location and relocation problem with uncertain number of future facilities ⋮ Finding the conditional location of a median path on a tree ⋮ On solving the discrete location problems when the facilities are prone to failure ⋮ The \(p\)-median problem under uncertainty ⋮ On solving unreliable planar location problems ⋮ An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems ⋮ A new formulation for the conditional \(p\)-median and \(p\)-center problems ⋮ The conditional \(p\)-dispersion problem ⋮ Multi-criteria location planning for public facilities in tsunami-prone coastal areas

Uses Software

• AMPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the Weber location problem
• Competitive location in the plane
• Location and layout planning. An international bibliography
• The zone-constrained location problem on a network
• A new bounding method for single facility location models
• The p-cover problem
• Heuristic procedures for the m-partial cover problem on a plane
• On locating new facilities in a competitive environment
• The \(p\) maximal cover -- \(p\) partial center problem on networks
• On a rational stopping rule for facilities location algorithms
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Technical Note—Conditional Location Problems on Networks
• Conditional p-Center Problems
• Note—On a Modified One-Center Model
• Bounding methods for facilities location algorithms