A note on solving large p-median problems-Reference-Cited by-同舟云学术

A note on solving large p-median problems

Published:1985-08 Issue:2 Volume:21 Page:270-273
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Beasley J.E.

Publisher

Elsevier BV

Subject

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

Reference7 articles.

1. p-medians and multimedians;Boffey;Journal of the Operational Research Society,1984

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

3. Solving large-scale zero-one linear programming problems;Crowder;Operations Research,1983

4. The Lagrangean relaxation method for solving integer programming problems;Fisher;Management Science,1981

5. Algorithm 97—shortest path;Floyd;Communications of the ACM,1962

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

1. A parallel variable neighborhood search for α-neighbor facility location problems;Computers & Operations Research;2024-05

2. Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem;EURO Journal on Computational Optimization;2024

3. A hyper-heuristic based approach with naive Bayes classifier for the reliability p-median problem;Applied Intelligence;2023-09-07

4. A branch-and-price approach for the continuous multifacility monotone ordered median problem;European Journal of Operational Research;2023-04

5. A novel approach for text categorization by applying hybrid genetic bat algorithm through feature extraction and feature selection methods;Expert Systems with Applications;2022-09