Lagrangean duals and exact solution to the capacitated p-center problem
From MaRDI portal
Publication:1044136
DOI10.1016/J.EJOR.2009.02.022zbMATH Open1177.90241OpenAlexW2025917696MaRDI QIDQ1044136FDOQ1044136
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
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
- A scatter search heuristic for the capacitated clustering problem
- Title not available (Why is that?)
- A column generation approach to capacitated \(p\)-median problems
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- How to Allocate Network Centers
- The Capacitated K-Center Problem
- Exact and approximation algorithms for clustering
- An exact algorithm for the capacitated vertex \(p\)-center problem
- 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
- Large-scale local search heuristics for the capacitated vertexp-center problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- A Lagrangean heuristic for the maximal covering location problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- An effective VNS for the capacitated \(p\)-median problem
Cited In (15)
- A scalable exact algorithm for the vertex \(p\)-center problem
- The stratified \(p\)-center problem
- A constructive heuristic for the uniform capacitated vertex \(k\)-center problem
- The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique
- Capacitated center problems with two-sided bounds and outliers
- Location of Emergency Facilities with Uncertainty in the Demands
- Mathematical Models and Search Algorithms for the Capacitated p-Center Problem
- Capacitated \(p\)-center problem with failure foresight
- When centers can fail: a close second opportunity
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
- Dynamically second-preferred \(p\)-center problem
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- An optimal algorithm for the weighted backup 2-center problem on a tree
- A dual bounding scheme for a territory design problem
- Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
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)
