When centers can fail: a close second opportunity
From MaRDI portal
Publication:337641
DOI10.1016/j.cor.2015.01.002zbMath1348.90376OpenAlexW2009430572MaRDI QIDQ337641
Maria Albareda-Sambola, Justo Puerto, Yolanda Hinojosa, Alfredo Marín
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/76239
Related Items (8)
The reliable \(p\)-median problem with at-facility service ⋮ The leader multipurpose shopping location problem ⋮ GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem ⋮ Dynamically second-preferred \(p\)-center problem ⋮ An exact approach for the reliable fixed-charge location problem with capacity constraints ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ GRASP and VNS for solving the \(p\)-next center problem ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
Cites Work
- Unnamed Item
- Closest assignment constraints in discrete location problems
- Single-allocation ordered median hub location problems
- New formulations for the uncapacitated multiple allocation hub location problem
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- A flexible model and efficient solution strategies for discrete location problems
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem
- New facets and a branch-and-cut algorithm for the weighted clique problem.
- An extended covering model for flexible discrete and equity location problems
- An exact algorithm for the capacitated vertex \(p\)-center problem
- One-way and round-trip center location problems
- New facets for the two-stage uncapacitated facility location polytope
- A New Formulation and Resolution Method for the p-Center Problem
- On the Complexity of Some Common Geometric Location Problems
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- 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
- The collection depots location problem on networks
- Collection depots facility location problems in trees
- On the collection depots location problem
This page was built for publication: When centers can fail: a close second opportunity
