A GRASP algorithm to solve the unicost set covering problem-Reference-Cited by-同舟云学术

A GRASP algorithm to solve the unicost set covering problem

Published:2007-10 Issue:10 Volume:34 Page:3162-3173
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Bautista Joaquín,Pereira Jordi

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference30 articles.

1. Bautista J, Pereira J. Locating collection areas for municipal waste management: an application to the metropolitan area of Barcelona. OMEGA, in Press. Corrected proof, available online 2 March 2005.

2. A heuristic method for the set covering problem;Caprara;Operational Research,1999

3. The location of emergency service facilities;Toregas;Operational Research,1971

4. Computers and intractability: a guide to the theory of NP-completeness;Garey,1979

5. OR-Library: distributing test problems by electronic mail;Beasley;Journal of Operational Research Society,1990

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

1. NuSC: An Effective Local Search Algorithm for Solving the Set Covering Problem;IEEE Transactions on Cybernetics;2022

2. An improved configuration checking-based algorithm for the unicost set covering problem;European Journal of Operational Research;2021-10

3. An Adaptive Feasible and Infeasible Search Algorithm for Solving the Set Covering Problem;Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery;2021

4. The Relationship between the Unicost Set Covering Problem and the Attribute Reduction Problem in Rough Set Theory;Mathematical Problems in Engineering;2020-06-16

5. A Heuristic Algorithm for the Set k-Cover Problem;Communications in Computer and Information Science;2020