Heuristic procedures for the m-partial cover problem on a plane-Reference-Cited by-同舟云学术

Heuristic procedures for the m-partial cover problem on a plane

Published:1982-10 Issue:2 Volume:11 Page:149-157
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Watson-Gandy C.D.T.

Publisher

Elsevier BV

Subject

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

Reference9 articles.

1. Cluster Analysis for Applications;Anderberg,1973

2. The chromatic reduction problem;Brown;Networks,1973

3. N. Christofides, A minimax facility location problem and the cardinality constrained set covering problem, Management Sci., to appear.

4. Formulation and solution of some location-allocation problems;Cooper,1965

5. Geometrical solutions for some minimax location problems;Elzinga;Transportation Sci.,1972

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

1. Algorithms for Cameras View-Frame Placement Problems in the Presence of an Adversary and Distributional Ambiguity;IEEE Transactions on Automation Science and Engineering;2024

2. A variable neighborhood search for the budget-constrained maximal covering location problem with customer preference ordering;Operational Research;2021-06-21

3. Cover-Based Competitive Location Models;Contributions to Location Analysis;2019

4. Territorial design optimization for business sales plan;Journal of Computational and Applied Mathematics;2018-10

5. Territorial Design Optimization for Business Sales Plan;Large-Scale Scientific Computing;2018