Lagrangean duals and exact solution to the capacitated \(p\)-center problem

DOI10.1016/j.ejor.2009.02.022zbMath1177.90241MaRDI QIDQ1044136

Maria Albareda-Sambola, Elena Fernández, Juan A. Díaz

Publication date: 10 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.02.022

zbMATH Keywords

Lagrangean relaxation; discrete location; capacitated \(p\)-center

Mathematics Subject Classification ID

90C10: Integer programming

90B80: Discrete location and assignment

Related Items

Capacitated \(p\)-center problem with failure foresight, Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent, When centers can fail: a close second opportunity, A dual bounding scheme for a territory design problem, Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management

Cites Work

• Unnamed Item
• An effective VNS for the capacitated \(p\)-median problem
• A Lagrangean heuristic for the maximal covering location problem
• A column generation approach to capacitated \(p\)-median problems
• Exact and approximation algorithms for clustering
• An exact algorithm for the capacitated vertex \(p\)-center problem
• A scatter search heuristic for the capacitated clustering problem
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• A New Formulation and Resolution Method for the p-Center Problem
• How to Allocate Network Centers
• Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
• Large-scale local search heuristics for the capacitated vertexp-center problem
• The Capacitated K-Center Problem
• A branch‐and‐price algorithm for the capacitated p‐median problem
• Capacitated clustering problems by hybrid simulated annealing and tabu search