Approximating the probabilistic \(p\)-center problem under pressure

DOI10.1007/s10878-024-01194-yMaRDI QIDQ6621850

Marcel A. Haddad, Cécile Murat, Marc Demange

Publication date: 21 October 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsprobabilistic combinatorial optimizationshelter location under indeterminacyunder pressure decision modelvariants of the \(p\)-center problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The \(p\)-neighbor \(k\)-center problem
• Easy and hard bottleneck location problems
• Unit disk graphs
• The probabilistic \(p\)-center problem: planning service for potential customers
• Complexity of robust single facility location problems on networks with uncertain edge lengths.
• A two-stage robust model for a reliable \(p\)-center facility location problem
• A robust \(p\)-center problem under pressure to locate shelters in wildfire context
• Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
• Facility location for large-scale emergencies
• A Best Possible Heuristic for the k-Center Problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Minimax regret p-center location on a network with demand uncertainty
• A stochastic programming approach for Shelter location and evacuation planning
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Approximating the probabilistic \(p\)-center problem under pressure