Capacitated \(p\)-center problem with failure foresight
From MaRDI portal
Publication:319964
DOI10.1016/j.ejor.2015.05.072zbMath1346.90488OpenAlexW2144214878MaRDI QIDQ319964
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
Integer programming (90C10) Reliability, availability, maintenance, inspection in operations research (90B25) Discrete location and assignment (90B80)
Related Items (7)
The probabilistic \(p\)-center problem: planning service for potential customers ⋮ An exact approach for the reliable fixed-charge location problem with capacity constraints ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Introducing capacities in the location of unreliable facilities ⋮ The stratified \(p\)-center problem ⋮ Minimax models for capacitated \(p\)-center problem in uncertain environment ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Double bound method for solving the \(p\)-center location problem
- Closest assignment constraints in discrete location problems
- The ordered capacitated facility location problem
- Designing robust coverage networks to hedge against worst-case facility losses
- A branch-and-cut method for the obnoxious \(p\)-median problem
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem
- A column generation approach to capacitated \(p\)-median problems
- A taxonomy for emergency service station location problem
- A bilevel fixed charge location model for facilities under imminent attack
- Probability chains: a general linearization technique for modeling reliability in facility location and related problems
- Determining optimal police patrol areas with maximal covering and backup covering location models
- A bilevel mixed-integer program for critical infrastructure protection planning
- An exact algorithm for the capacitated vertex \(p\)-center problem
- A New Formulation and Resolution Method for the p-Center Problem
- 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
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- How to Allocate Network Centers
- 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
- The Capacitated K-Center Problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- A Reliability Model Applied to Emergency Service Vehicle Location
This page was built for publication: Capacitated \(p\)-center problem with failure foresight
