Complexity of local search for the p-median problem-Reference-Cited by-同舟云学术

Complexity of local search for the p-median problem

Published:2008-12 Issue:3 Volume:191 Page:736-752
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Alekseeva Ekaterina,Kochetov Yuri,Plyasunov Alexander

Publisher

Elsevier BV

Subject

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

Reference16 articles.

1. Local search heuristics for k-median and facility location problems;Arya;SIAM Journal on Computing,2004

2. Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties;Ausiello,1999

3. Extremal Standardization Problems;Beresnev,1978

4. A linear time heuristic for improving network partitions;Fiduccia,1982

5. How easy is local search?;Johnson;Journal of Computer and system Sciences,1988

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

1. Discrete Facility Location in Machine Learning;Journal of Applied and Industrial Mathematics;2021-11

2. Graph Pricing with Limited Supply;Lecture Notes in Computer Science;2021

3. A Hybrid Local Search Algorithm for the Consistent Periodic Vehicle Routing Problem;Journal of Applied and Industrial Mathematics;2020-05

4. The Branch and Cut Method for the Clique Partitioning Problem;Journal of Applied and Industrial Mathematics;2019-07

5. A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand;Journal of Applied and Industrial Mathematics;2019-07