When centers can fail: a close second opportunity

DOI10.1016/J.COR.2015.01.002zbMATH Open1348.90376OpenAlexW2009430572MaRDI QIDQ337641FDOQ337641

Authors: Maria Albareda-Sambola, Yolanda Hinojosa, Alfredo Marín, Justo Puerto 

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

Recommendations

• Capacitated \(p\)-center problem with failure foresight
• GRASP and VNS for solving the \(p\)-next center problem
• Facility location for large-scale emergencies
• Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
• Location of Emergency Facilities with Uncertainty in the Demands

zbMATH Keywords

integer programming\(p\)-centerdiscrete location

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
• Title not available (Why is that?)
• 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
• One-way and round-trip center location problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• How to Allocate Network Centers
• 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
• On the Complexity of Some Common Geometric Location Problems
• Single-allocation ordered median hub location problems
• Closest assignment constraints in discrete location problems
• An exact algorithm for the capacitated vertex \(p\)-center problem
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem
• An extended covering model for flexible discrete and equity location problems
• A new formulation and resolution method for the \(p\)-center 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
• A flexible model and efficient solution strategies for discrete location problems
• New facets and a branch-and-cut algorithm for the weighted clique problem.
• New facets for the two-stage uncapacitated facility location polytope

Cited In (10)

• 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
• The leader multipurpose shopping location problem
• An exact approach for the reliable fixed-charge location problem with capacity constraints
• Capacitated \(p\)-center problem with failure foresight
• The reliable \(p\)-median problem with at-facility service
• Formulations and valid inequalities for the capacitated dispersion problem
• GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem
• Dynamically second-preferred \(p\)-center problem
• A tale of two centres

This page was built for publication: When centers can fail: a close second opportunity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337641)