Hybrid scatter search and path relinking for the capacitated p-median problem-Reference-Cited by-同舟云学术

Hybrid scatter search and path relinking for the capacitated p-median problem

Published:2006-03 Issue:2 Volume:169 Page:570-585
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

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

Reference18 articles.

1. A tree search algorithm for the p-median problem;Christofides;European Journal of Operational Research,1981

2. A tabu search heuristic for the generalized assignment problem;Díaz;European Journal of Operational Research,2001

3. A branch and price algorithm for the single source capacitated plant location problem;Díaz;Journal of Operational Research Society,2002

4. Fundamentals of scatter search and path relinking;Laguna;Control and Cybernetics,2000

5. Greedy randomized adaptive search procedures;Feo;Journal of Global Optimization,1995

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

1. Regionalization of primary health care units: An iterated greedy algorithm for large-scale instances;Expert Systems with Applications;2024-09

2. A Tri-level minimum information demand estimation model to the inverse p-median problem;OPSEARCH;2024-07-22

3. A traffic-based model to the p-median problem in congested networks;COMMUN COMB OPTIM;2024

4. Large Neighborhood Search for the Capacitated P-Median Problem;Lecture Notes in Computer Science;2024

5. Standortplanung und Netzwerkgestaltung;Computational Intelligence in Logistik und Supply Chain Management;2023