Some heuristic methods for solving p-median problems with a coverage constraint-Reference-Cited by-同舟云学术

Some heuristic methods for solving p-median problems with a coverage constraint

Published:2012-07 Issue:2 Volume:220 Page:320-327
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Sáez-Aguado Jesús,Trandafir Paula Camelia

Publisher

Elsevier BV

Subject

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

Reference35 articles.

1. A Lagrangean-relaxation method for the constrained assignment problem;Aggarwal;Computers and Operation Research,1985

2. Minimal spanning tree subject to a side constraint;Aggarwal;Computers and Operations Research,1982

3. Comparative analysis of modern optimization tools for the p-median problem;Alba;Statistics and Computing,2006

4. An effective heuristic for large-scale capacitated facility location problems;Avella;Journal of Heuristics,2009

5. Computational study of large-scale p-median problems;Avella;Mathematical Programming,2007

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

1. Better guarantees for k-median with service installation costs;Theoretical Computer Science;2022-06

2. Hierarchical Physician Recommendation via Diversity-enhanced Matrix Factorization;ACM Transactions on Knowledge Discovery from Data;2021-01-06

3. A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments;Networks and Spatial Economics;2018-12

4. Variants of the $$ \varepsilon $$ ε -constraint method for biobjective integer programming problems: application to p-median-cover problems;Mathematical Methods of Operations Research;2017-10-22

5. A methodology for minimizing LPG transportation impact;Management of Environmental Quality: An International Journal;2017-09-11