A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff
From MaRDI portal
Publication:2514827
DOI10.1016/j.ejor.2014.01.040zbMath1304.90125MaRDI QIDQ2514827
Edward A. Pohl, Manuel D. Rossetti, Hugh R. Medal
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.01.040
location; discrete optimization; multiple objective programming; interdiction; catastrophe planning and management
90C11: Mixed integer programming
90C29: Multi-objective and goal programming
90B80: Discrete location and assignment
Related Items
Optimizing fortification plan of capacitated facilities with maximum distance limits, A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption, Multi-echelon supply chain design considering unreliable facilities with facility hardening possibility
Uses Software
Cites Work
- Unnamed Item
- Reliable facility location design under disruptions
- Optimizing system resilience: a facility protection model with recovery time
- Designing robust coverage networks to hedge against worst-case facility losses
- Approximation algorithms for combinatorial problems
- Generalized \(p\)-center problems: Complexity results and approximation algorithms
- An efficient genetic algorithm for the \(p\)-median problem
- A column generation approach to capacitated \(p\)-median problems
- Probability chains: a general linearization technique for modeling reliability in facility location and related problems
- A bilevel mixed-integer program for critical infrastructure protection planning
- An exact solution approach for the interdiction median problem with fortification
- A New Formulation and Resolution Method for the p-Center Problem
- Reliable Facility Location Design Under the Risk of Disruptions
- A facility reliability problem: Formulation, properties, and algorithm
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- TSPLIB—A Traveling Salesman Problem Library
- The p-center location problem in an area
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Large-scale local search heuristics for the capacitated vertexp-center problem
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
