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

DOI10.1016/J.EJOR.2009.02.022MaRDI QIDQ1044136zbMATHOpenAlexFDO

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

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 relaxationdiscrete locationcapacitated \(p\)-center

Mathematics Subject Classification ID

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

Recommendations

• Two exact algorithms for the capacitated \(p\)-median problem
• An exact algorithm for the capacitated vertex \(p\)-center problem
• Mathematical models and search algorithms for the capacitated \(p\)-center problem
• A new method for solving capacitated location problems based on a set partitioning approach
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• A Lagrangean heuristic for the maximal covering location problem
• A branch‐and‐price algorithm for the capacitated p‐median problem
• A column generation approach to capacitated \(p\)-median problems
• A new formulation and resolution method for the \(p\)-center problem
• A scatter search heuristic for the capacitated clustering problem
• An effective VNS for the capacitated \(p\)-median problem
• An exact algorithm for the capacitated vertex \(p\)-center problem
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Exact and approximation algorithms for clustering
• How to Allocate Network Centers
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• Large-scale local search heuristics for the capacitated vertexp-center problem
• Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
• The Capacitated K-Center Problem

Cited in

(15)

• The capacitated single-source \(p\)-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique
• Mathematical models and search algorithms for the capacitated \(p\)-center problem
• Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
• The stratified \(p\)-center problem
• Location of Emergency Facilities with Uncertainty in the Demands
• A constructive heuristic for the uniform capacitated vertex \(k\)-center problem
• A scalable exact algorithm for the vertex \(p\)-center problem
• Dynamically second-preferred \(p\)-center problem
• Capacitated center problems with two-sided bounds and outliers
• 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
• An optimal algorithm for the weighted backup 2-center problem on a tree
• When centers can fail: a close second opportunity
• A dual bounding scheme for a territory design problem

This page was built for publication: Lagrangean duals and exact solution to the capacitated \(p\)-center problem

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