Enhancements to Two Exact Algorithms for Solving the Vertex P-Center Problem-Reference-Cited by-同舟云学术

Enhancements to Two Exact Algorithms for Solving the Vertex P-Center Problem

Published:2005-06 Issue:2 Volume:4 Page:129-147
ISSN:1570-1166
Container-title:Journal of Mathematical Modelling and Algorithms
language:en
Short-container-title:J Math Model Algor

Author:

Al-khedhairi A.,Salhi S.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Modeling and Simulation

Link

http://link.springer.com/content/pdf/10.1007/s10852-004-4072-3.pdf

Reference12 articles.

1. Beasley, J. E.: A note on solving large P-median problems, European J. Oper. Res. 21 (1985), 270–273.

2. Beasley, J. E.: OR library: Distributing test problems by electronic mail, J. Oper. Res. Soc. 41(11) (1990), 1069–1072.

3. Daskin, M. S.: Network and Discrete Locations: Models, Algorithms, and Applications, Wiley, New York, 1995, pp. 154–191.

4. Daskin, M.: A new approach to solve the vertex P-center problem to optimality: Algorithm and computational results, Comm. Oper. Res. Soc. Japan 45(9) (2000), 428–436.

5. Elloumi, S., Labbé, M. and Pochet, Y.: New formulation and resolution method for the P-center problem, http://www.optimization-online.org/DB.HTML/2001/10/394.html, 2001.

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

1. A vertex weighting-based double-tabu search algorithm for the classical p-center problem;Computers & Operations Research;2023-12

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

3. Exact solution approaches for the discrete α‐neighbor p‐center problem;Networks;2023-06-13

4. Exploiting flat subspaces in local search for p-Center problem and two fault-tolerant variants;Computers & Operations Research;2023-01

5. The FastMap Pipeline for Facility Location Problems;PRIMA 2022: Principles and Practice of Multi-Agent Systems;2022-11-12