The stratified \(p\)-center problem
From MaRDI portal
Publication:2003436
DOI10.1016/j.cor.2019.04.013zbMath1458.90407arXiv1808.01307OpenAlexW2886892883MaRDI QIDQ2003436
Luisa I. Martínez-Merino, Maria Albareda-Sambola, Antonio M. Rodríguez-Chía
Publication date: 8 July 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.01307
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A comparative study of different formulations for the capacitated discrete ordered median problem ⋮ The multi-period \(p\)-center problem with time-dependent travel times ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Minimax models for capacitated \(p\)-center problem in uncertain environment
Uses Software
Cites Work
- Unnamed Item
- Capacitated \(p\)-center problem with failure foresight
- Robust vertex \(p\)-center model for locating urgent relief distribution centers
- Double bound method for solving the \(p\)-center location problem
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
- An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem
- Closest assignment constraints in discrete location problems
- The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem
- A flexible model and efficient solution strategies for discrete location problems
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem
- A scalable exact algorithm for the vertex \(p\)-center problem
- The probabilistic \(p\)-center problem: planning service for potential customers
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
- An exact algorithm for the capacitated vertex \(p\)-center problem
- The empirical behavior of sampling methods for stochastic programming
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- A New Formulation and Resolution Method for the p-Center Problem
- Solving Large p-Median Problems with a Radius Formulation
- Algorithms for finding P-centers on a weighted tree (for relatively small P)
- Competitive Location on a Network
- Conditional p-Center Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- The m-Center Problem: Minimax Facility Location
- Minimax regret p-center location on a network with demand uncertainty
- Analysis of Sample-Path Optimization
- Integer Programming: Methods, Uses, Computations
This page was built for publication: The stratified \(p\)-center problem
