Robust vertex \(p\)-center model for locating urgent relief distribution centers

DOI10.1016/j.cor.2013.02.019zbMath1348.90405OpenAlexW2037128087MaRDI QIDQ336453

Jiuh-Biing Sheu, Chung-Cheng Lu

Publication date: 10 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.019

zbMATH Keywords

facility locationrobust optimizationdata uncertaintyemergency logistics

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Discrete location and assignment (90B80)

Related Items

Emergency facility location under random network damage: insights from the Istanbul case ⋮ The probabilistic \(p\)-center problem: planning service for potential customers ⋮ A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem ⋮ Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem ⋮ Exact solution approaches for the discrete α‐neighbor p‐center problem ⋮ OR models in urban service facility location: a critical review of applications and future developments ⋮ The stratified \(p\)-center problem ⋮ Multiobjective optimization on hierarchical refugee evacuation and resource allocation for disaster management ⋮ Prepositioning emergency earthquake response supplies: a new multi-objective particle swarm optimization algorithm

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• Robust discrete optimization and its applications
• Algorithms for the robust 1-center problem on a tree
• Production planning in furniture settings via robust optimization
• Risk-averse two-stage stochastic programming with an application to disaster management
• Robust scheduling on a single machine to minimize total flow time
• Complexity of robust single facility location problems on networks with uncertain edge lengths.
• A note on the robust 1-center problem on trees
• An exact algorithm for the robust shortest path problem with interval data
• Robust multiperiod portfolio management in the presence of transaction costs
• Facility location for large-scale emergencies
• OR/MS research in disaster operations management
• A survey of simulated annealing as a tool for single and multiobjective optimization
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Minimax regret p-center location on a network with demand uncertainty