Lagrangean duals and exact solution to the capacitated p-center problem-Reference-Cited by-同舟云学术

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

Published:2010-02 Issue:1 Volume:201 Page:71-81
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

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

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference15 articles.

1. Exact and approximation algorithms for clustering;Agarwal;Algorithmica,2002

2. How to allocate network centers;Bar-Ilan;Journal of Algorithms,1993

3. A branch-and-price algorithm for the capacitated p-median problem;Ceselli;Networks,2005

4. Hybrid scatter search and path relinking for the capacitated p-median problem;Díaz;European Journal of Operational Research,2006

5. A new formulation and resolution method for the p-center problem;Elloumi;INFORMS Journal on Computing,2004

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Healthcare Facility Location;Decision Making in Healthcare Systems;2024

2. A Two-Stage Iterated Local Search Algorithm for the Capacitated p-Center Problem;2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC);2023-10-01

3. A Constructive Heuristic for the Uniform Capacitated Vertex k -center Problem;ACM Journal of Experimental Algorithmics;2023-08-11

4. Dynamically second-preferred p-center problem;European Journal of Operational Research;2023-05

5. Location problem of Osmia cornuta nesting aids for optimum pollination;PLOS ONE;2020-12-31