Capacitated p-center problem with failure foresight
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- A Reliability Model Applied to Emergency Service Vehicle Location
- A bilevel fixed charge location model for facilities under imminent attack
- A bilevel mixed-integer program for critical infrastructure protection planning
- A branch-and-cut method for the obnoxious \(p\)-median problem
- A column generation approach to capacitated \(p\)-median problems
- A new formulation and resolution method for the \(p\)-center problem
- A taxonomy for emergency service station location problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An exact algorithm for the capacitated vertex \(p\)-center problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Closest assignment constraints in discrete location problems
- Designing robust coverage networks to hedge against worst-case facility losses
- Determining optimal police patrol areas with maximal covering and backup covering location models
- Double bound method for solving the p-center location problem
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- How to Allocate Network Centers
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem
- Large-scale local search heuristics for the capacitated vertexp-center problem
- Probability chains: a general linearization technique for modeling reliability in facility location and related problems
- Reliable facility location design under the risk of disruptions
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
- The Capacitated K-Center Problem
- The ordered capacitated facility location problem
- The reliable facility location problem: formulations, heuristics, and approximation algorithms
Cited in
(10)- Mathematical models and search algorithms for the capacitated \(p\)-center problem
- 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
- When centers can fail: a close second opportunity
- Facility location for large-scale emergencies
- Minimax models for capacitated \(p\)-center problem in uncertain environment
- Formulations and valid inequalities for the capacitated dispersion problem
- Dynamically second-preferred \(p\)-center problem
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)
