Dominant, an algorithm for the p-center problem-Reference-Cited by-同舟云学术

Dominant, an algorithm for the p-center problem

Published:2003-08 Issue:1 Volume:149 Page:53-64
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Caruso C.,Colorni A.,Aloi L.

Publisher

Elsevier BV

Subject

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

Reference20 articles.

1. A note on solving large p-median problems;Beasley;European Journal of Operational Research,1985

2. OR-library: Distributing test problems by electronic mail;Beasley;Journal of the Operational Research Society,1990

3. Polynomially bounded algorithms for locating p-centers on a tree;Chandrasekaran;Mathematical Programming,1982

4. A computational survey of methods for the set covering problem;Christofides;Management Science,1975

5. Network and Discrete Location: Models, Algorithms and Applications;Daskin,1995

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

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

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

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

4. A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem;European Journal of Operational Research;2022-11

5. Data Exploration by Representative Region Selection: Axioms and Convergence;Mathematics of Operations Research;2021-08