Capacitated p-center problem with failure foresight
DOI10.1016/J.EJOR.2015.05.072zbMATH Open1346.90488OpenAlexW2144214878MaRDI QIDQ319964FDOQ319964
Inmaculada Espejo, Antonio M. Rodríguez-Chía, Alfredo Marín
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.072
Recommendations
- Facility location for large-scale emergencies
- When centers can fail: a close second opportunity
- Location of Emergency Facilities with Uncertainty in the Demands
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- Minimax models for capacitated \(p\)-center problem in uncertain environment
Reliability, availability, maintenance, inspection in operations research (90B25) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- A bilevel mixed-integer program for critical infrastructure protection planning
- Title not available (Why is that?)
- A column generation approach to capacitated \(p\)-median problems
- A bilevel fixed charge location model for facilities under imminent attack
- Determining optimal police patrol areas with maximal covering and backup covering location models
- The reliable facility location problem: formulations, heuristics, and approximation algorithms
- Reliable Facility Location Design Under the Risk of Disruptions
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- Title not available (Why is that?)
- Designing robust coverage networks to hedge against worst-case facility losses
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- How to Allocate Network Centers
- The Capacitated K-Center Problem
- Closest assignment constraints in discrete location problems
- The ordered capacitated facility location problem
- A branch-and-cut method for the obnoxious \(p\)-median problem
- An exact algorithm for the capacitated vertex \(p\)-center problem
- A Reliability Model Applied to Emergency Service Vehicle Location
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem
- A taxonomy for emergency service station location problem
- Probability chains: a general linearization technique for modeling reliability in facility location and related problems
- A new formulation and resolution method for the \(p\)-center problem
- Double bound method for solving the \(p\)-center location problem
- Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Large-scale local search heuristics for the capacitated vertexp-center problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
Cited In (7)
- The stratified \(p\)-center problem
- Introducing capacities in the location of unreliable facilities
- An exact approach for the reliable fixed-charge location problem with capacity constraints
- The probabilistic \(p\)-center problem: planning service for potential customers
- Mathematical Models and Search Algorithms for the Capacitated p-Center Problem
- Minimax models for capacitated \(p\)-center problem in uncertain environment
- Formulations and valid inequalities for the capacitated dispersion problem
Uses Software
This page was built for publication: Capacitated \(p\)-center problem with failure foresight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319964)
