A two-stage robust model for a reliable \(p\)-center facility location problem

DOI10.1016/j.apm.2019.07.025zbMath1443.90239OpenAlexW2958280390WikidataQ127462639 ScholiaQ127462639MaRDI QIDQ1988633

Roel Leus, Hong Zhou, Bo Du

Publication date: 24 April 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2019.07.025

zbMATH Keywords

uncertaintyfacility locationrobust optimization\(p\)-center problemreliable network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (6)

Wildfire burn scar encapsulation. Subsetting common spatial domains for post-wildfire debris flow predictions over the United States ⋮ Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem ⋮ A robust \(p\)-center problem under pressure to locate shelters in wildfire context ⋮ An inexact column-and-constraint generation method to solve two-stage robust optimization problems ⋮ Minimax models for capacitated \(p\)-center problem in uncertain environment ⋮ Robustness of solutions to the capacitated facility location problem with uncertain demand

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Reliable facility location design under disruptions
• Robust location transportation problems under uncertain demands
• Partitioning procedures for solving mixed-variables programming problems
• Robust discrete optimization and its applications
• Adjustable robust solutions of uncertain linear programs
• Supply chain network design under uncertainty: a comprehensive review and future research directions
• Recovery strategies from major supply disruptions in single and multiple sourcing networks
• Introducing capacities in the location of unreliable facilities
• Stochastic survivable network design problems: theory and practice
• Complexity results and exact algorithms for robust knapsack problems
• Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
• Facility location for large-scale emergencies
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Generalized Benders decomposition
• Network and Discrete Location: Models, Algorithms, and Applications, Second Edition
• The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
• Reliable Facility Location Design Under the Risk of Disruptions
• Theory and Applications of Robust Optimization
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Minimax regret p-center location on a network with demand uncertainty
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• Location Science

This page was built for publication: A two-stage robust model for a reliable \(p\)-center facility location problem